MétaCan
Menu
Back to cohort
Record W4317672241 · doi:10.1080/14697688.2023.2167666

Efficient pricing and hedging of high-dimensional American options using deep recurrent networks

2023· article· en· W4317672241 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueQuantitative Finance · 2023
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicStochastic processes and financial applications
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRecurrent neural networkFeed forwardComputer scienceFeedforward neural networkArtificial neural networkDeep learningQuadratic equationMathematical optimizationArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

We propose a deep recurrent neural network (RNN) framework for computing prices and deltas of American options in high dimensions. Our proposed framework uses two deep RNNs, where one network learns the continuation price and the other learns the delta for each timestep. Our proposed framework yields prices and deltas for the entire spacetime, not only at a given point (e.g. t = 0). The computational cost of the proposed approach is linear in N, which improves on the quadratic time seen for feedforward networks that price American options. The computational memory cost of our method is constant in N, which is an improvement over the linear memory costs seen in feedforward networks. Our numerical simulations demonstrate these contributions and show that the proposed deep RNN framework is computationally more efficient than traditional feedforward neural network frameworks in time and memory.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.772
Threshold uncertainty score0.569

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.044
GPT teacher head0.282
Teacher spread0.238 · 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