Pith. sign in

REVIEW 1 cited by

Optimal Stopping via Randomized Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.13669 v4 pith:Z6NP2O3J submitted 2021-04-28 stat.ML cs.LGcs.NAmath.NAmath.PRq-fin.CP

classification stat.MLcs.LGcs.NAmath.NAmath.PRq-fin.CP
keywords approachesnetworksneuralstoppingamericanapproximatehestonoptimal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents the benefits of using randomized neural networks instead of standard basis functions or deep neural networks to approximate the solutions of optimal stopping problems. The key idea is to use neural networks, where the parameters of the hidden layers are generated randomly and only the last layer is trained, in order to approximate the continuation value. Our approaches are applicable to high dimensional problems where the existing approaches become increasingly impractical. In addition, since our approaches can be optimized using simple linear regression, they are easy to implement and theoretical guarantees can be provided. We test our approaches for American option pricing on Black--Scholes, Heston and rough Heston models and for optimally stopping a fractional Brownian motion. In all cases, our algorithms outperform the state-of-the-art and other relevant machine learning approaches in terms of computation time while achieving comparable results. Moreover, we show that they can also be used to efficiently compute Greeks of American options.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Time Deep Gradient Flow Method for pricing American options

    q-fin.CP 2025-07 conditional novelty 4.0 of 10

    The Time Deep Gradient Flow method is extended to American options by training only where the price exceeds the payoff, yielding faster training than the Deep Galerkin Method.

Pith tools