Finite Difference Solution Ansatz approach in Least-Squares Monte Carlo
This article presents a simple but effective and efficient approach to improve the accuracy and stability of Least-Squares Monte Carlo. The key idea is to construct the ansatz of conditional expected continuation payoff using the finite difference solution from one dimension, to be used in linear regression. This approach bridges between solving backward partial differential equations and Monte Carlo simulation, aiming at achieving the best of both worlds. In a general setting encompassing both local and stochastic volatility models, the ansatz is proven to act as a control variate, reducing the mean squared error, thereby leading to a reduction of the final pricing error. We illustrate the technique with realistic examples including Bermudan options, worst of issuer callable notes and expected positive exposure on European options under valuation adjustments.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Concentration bounds for temporal difference learning with linear function approximation: The case of batch data and uniform sampling
We propose a stochastic approximation (SA) based method with randomization of samples for policy evaluation using the least squares temporal difference (LSTD) algorithm. Our proposed scheme is equivalent to running regul…
Multi-Armed BanditsNews RecommendationregressionTraffic Signal ControlConductivity Imaging from Internal Measurements with Mixed Least-Squares Deep Neural Networks
In this work we develop a novel approach using deep neural networks to reconstruct the conductivity distribution in elliptic problems from one measurement of the solution over the whole domain. The approach is based on a…
Accelerated Gradient Temporal Difference Learning
The family of temporal difference (TD) methods span a spectrum from computationally frugal linear methods like TD({\lambda}) to data efficient least squares methods. Least square methods make the best use of available da…
Robust Least-Squares Optimization for Data-Driven Predictive Control: A Geometric Approach
The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as e…
Concentration inequalities for semidefinite least squares based on data
We study data-driven least squares (LS) problems with semidefinite (SD) constraints and derive finite-sample guarantees on the spectrum of their optimal solutions when these constraints are relaxed. In particular, we pro…