General error estimates for the Longstaff-Schwartz least-squares Monte Carlo algorithm

DOI10.1287/MOOR.2019.1017MaRDI QIDQ3387908zbMATH OpenOpenAlexFDO

Authors Daniel Z. Zanger

Publication date 8 January 2021

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2019.1017

zbMATH Keywords

American optionsMonte Carlo algorithmsleast-squares regressionstatistical learning theoryoptimal stopping criteria

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Derivative securities (option pricing, hedging, etc.) (91G20) Numerical methods (including Monte Carlo methods) (91G60) Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing
• Monte Carlo algorithms for optimal stopping and statistical learning
• Convergence of a Least‐Squares Monte Carlo Algorithm for Bounded Approximating Sets
• Convergence of a least-squares Monte Carlo algorithm for American option pricing with dependent sample data
• On the stability the least squares Monte Carlo

Cites work

• scientific article; zbMATH DE number 3875591 (Why is no real title available?)
• scientific article; zbMATH DE number 477682 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• A distribution-free theory of nonparametric regression
• A dynamic look-ahead Monte Carlo algorithm for pricing Bermudan options
• A fast randomized algorithm for overdetermined linear least-squares regression
• A regression-based Monte Carlo method to solve backward stochastic differential equations
• A review on regression-based Monte Carlo methods for pricing American options
• An analysis of a least squares regression method for American option pricing
• Convergence of a Least‐Squares Monte Carlo Algorithm for Bounded Approximating Sets
• Convergence of a least-squares Monte Carlo algorithm for American option pricing with dependent sample data
• Convergence of stochastic processes
• Efficient agnostic learning of neural networks with bounded fan-in
• Faster least squares approximation
• Least squares problems with inequality constraints as quadratic constraints
• Monte Carlo algorithms for optimal stopping and statistical learning
• Number of paths versus number of basis functions in American option pricing
• On the mathematical foundations of learning
• Optimal global rates of convergence for nonparametric regression
• Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives
• Pricing Bermudan options by nonparametric regression: optimal rates of convergence for lower estimates
• Pricing of high-dimensional American options by neural networks
• Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• The longstaff-Schwartz algorithm for Lévy models: results on fast and slow convergence
• Valuing American options by simulation: a simple least-squares approach

Cited in

(4)

• Nonexact oracle inequalities, \(r\)-learnability, and fast rates
• Primal-Dual Regression Approach for Markov Decision Processes with General State and Action Spaces
• American option pricing with regression: convergence analysis
• Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing

This page was built for publication: General error estimates for the Longstaff-Schwartz least-squares Monte Carlo algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387908)