MétaCan
Menu
Back to cohort
Record W4391076635 · doi:10.21203/rs.3.rs-3877425/v1

Ensemble deep neural network method for solving free boundary American style stochastic volatility models

2024· preprint· en· W4391076635 on OpenAlexafffund
Chinonso Nwankwo, Tony Ware, Weizhong Dai

Bibliographic record

VenueResearch Square · 2024
Typepreprint
Languageen
FieldEngineering
TopicEnergy Load and Power Forecasting
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsArtificial neural networkVolatility (finance)Deep neural networksArtificial intelligenceComputer scienceStyle (visual arts)Stochastic volatilityEconometricsMachine learningEconomicsHistoryArchaeology

Abstract

fetched live from OpenAlex

Abstract We present an ensemble deep learning method for solving free boundary American style stochastic volatility models. To this end, we cast our solution framework as a free boundary problem where the early exercise boundary surface, as a function of time and volatility, is approximated simultaneously with the value function and Greeks. For precise computation of the free boundary plane, we first use the Landau transformation to fix the free boundary and normalize the value function and the time domain. We then develop a novel ensemble auxiliary operator (EANO) involving suite of configurations based on the ensemble neural network output (ENNO). The early exercise boundary surface, value function, delta sensitivity, vega, gamma, vomma and vanna are predicted from the EENO, EANO, and the derivatives of EANO after training. The performance of our neural network configuration is verified and validated by comparison with some existing methods and examples. It provides an alternative approach for solving free boundary stochastic volatility models

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.054
GPT teacher head0.357
Teacher spread0.303 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueResearch SquareSame topicEnergy Load and Power ForecastingFrench-language works237,207