A framework for adaptive Monte Carlo procedures
DOI10.1515/MCMA.2011.002zbMath1223.65003arXiv1001.3551MaRDI QIDQ3168631
Jérôme Lelong, Bernard Lapeyre
Publication date: 19 April 2011
Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.3551
convergence; importance sampling; stochastic approximation; Brownian motion; numerical experiments; Monte Carlo methods; adaptive algorithm; central limit theorem; variance reduction; basket options; risk neutral measure; local volatility model; expectation with free parameter
91G60: Numerical methods (including Monte Carlo methods)
60F05: Central limit and other weak theorems
65C05: Monte Carlo methods
60J65: Brownian motion
65C40: Numerical analysis or methods applied to Markov chains
62L20: Stochastic approximation
65C30: Numerical solutions to stochastic differential and integral equations
Related Items
Cites Work
- Adaptive Monte Carlo variance reduction for Lévy processes with two-time-scale stochastic approximation
- Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions
- Proofs of the martingale FCLT
- Robust adaptive importance sampling for normal random vectors
- Unconstrained recursive importance sampling
- Asymptotically Optimal Importance Sampling and Stratification for Pricing Path-Dependent Options
- Stochastic Approximation with Averaging of the Iterates: Optimal Asymptotic Rate of Convergence for General Processes
- Central limit theorems for local martingales
- Acceleration of Stochastic Approximation by Averaging
- Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms
- Adaptative Monte Carlo Method, A Variance Reduction Technique
- Optimal Importance Sampling Parameter Search for Lévy Processes via Stochastic Approximation
- Adaptive Control Variates for Finite-Horizon Simulation
- A Stochastic Approximation Method