Robust adaptive importance sampling for normal random vectors
From MaRDI portal
(Redirected from Publication:983877)
Abstract: Adaptive Monte Carlo methods are very efficient techniques designed to tune simulation estimators on-line. In this work, we present an alternative to stochastic approximation to tune the optimal change of measure in the context of importance sampling for normal random vectors. Unlike stochastic approximation, which requires very fine tuning in practice, we propose to use sample average approximation and deterministic optimization techniques to devise a robust and fully automatic variance reduction methodology. The same samples are used in the sample optimization of the importance sampling parameter and in the Monte Carlo computation of the expectation of interest with the optimal measure computed in the previous step. We prove that this highly dependent Monte Carlo estimator is convergent and satisfies a central limit theorem with the optimal limiting variance. Numerical experiments confirm the performance of this estimator: in comparison with the crude Monte Carlo method, the computation time needed to achieve a given precision is divided by a factor between 3 and 15.
Recommendations
- Unconstrained recursive importance sampling
- Optimizing adaptive importance sampling by stochastic approximation
- Adaptive importance sampling Monte Carlo simulation for general multivariate probability laws
- Optimal importance sampling parameter search for Lévy processes via stochastic approximation
- A framework for adaptive Monte Carlo procedures
Cites work
- scientific article; zbMATH DE number 439951 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 1999206 (Why is no real title available?)
- scientific article; zbMATH DE number 3992716 (Why is no real title available?)
- Adaptative Monte Carlo Method, A Variance Reduction Technique
- Adaptive Control Variates for Finite-Horizon Simulation
- Adaptive optimal allocation in stratified sampling methods
- Almost sure convergence of randomly truncated stochastic algorithms under verifiable condi\-tions
- Asymptotic study of stochastic algorithms and price calculations of Parisian options.
- Asymptotically optimal importance sampling and stratification for pricing path-dependent options
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
- Unconstrained recursive importance sampling
Cited in
(24)- Approximation of Stochastic Volterra Equations with kernels of completely monotone type
- Dual pricing of American options by Wiener chaos expansion
- Adaptive importance sampling in least-squares Monte Carlo algorithms for backward stochastic differential equations
- Adaptive importance sampling and control variates
- Dynamic Finite-Budget Allocation of Stratified Sampling with Adaptive Variance Reduction by Strata
- Acceleration on adaptive importance sampling with sample average approximation
- Importance sampling and statistical Romberg method
- On sample average approximation algorithms for determining the optimal importance sampling parameters in pricing financial derivatives on Lévy processes
- The square root rule for adaptive importance sampling
- Adaptive importance sampling for multilevel Monte Carlo Euler method
- Importance accelerated Robbins-Monro recursion with applications to parametric confidence limits
- An efficient exponential twisting importance sampling technique for pricing financial derivatives
- Coupling importance sampling and multilevel Monte Carlo using sample average approximation
- Robust adaptive numerical integration of irregular functions with applications to basket and other multi-dimensional exotic options
- Optimal \(L_2\)-norm empirical importance weights for the change of probability measure
- Optimizing adaptive importance sampling by stochastic approximation
- Convergence of Markovian stochastic approximation with discontinuous dynamics
- A framework for adaptive Monte Carlo procedures
- Importance sampling for McKean-Vlasov SDEs
- Importance sampling for option pricing with feedforward neural networks
- Efficient estimation of multiple expectations with the same sample by adaptive importance sampling and control variates
- Adaptive importance sampling Monte Carlo simulation for general multivariate probability laws
- Rare event simulation for electronic circuit design
- Convenient multiple directions of stratification
This page was built for publication: Robust adaptive importance sampling for normal random vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983877)
