Skip to Main content Skip to Navigation
Journal articles

Unconstrained Recursive Importance Sampling

Abstract : We propose an unconstrained stochastic approximation method of finding the optimal measure change (in an a priori parametric family) for Monte Carlo simulations. We consider different parametric families based on the Girsanov theorem and the Esscher transform (or exponential-tilting). In a multidimensional Gaussian framework, Arouna uses a projected Robbins-Monro procedure to select the parameter minimizing the variance. In our approach, the parameter (scalar or process) is selected by a classical Robbins-Monro procedure without projection or truncation. To obtain this unconstrained algorithm we intensively use the regularity of the density of the law without assume smoothness of the payoff. We prove the convergence for a large class of multidimensional distributions and diffusion processes. We illustrate the effectiveness of our algorithm via pricing a Basket payoff under a multidimensional NIG distribution, and pricing a barrier options in different markets.
Document type :
Journal articles
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Gilles Pagès <>
Submitted on : Monday, June 8, 2009 - 7:21:01 PM
Last modification on : Monday, December 14, 2020 - 9:45:07 AM
Long-term archiving on: : Saturday, November 26, 2016 - 9:51:57 AM


Files produced by the author(s)



Vincent Lemaire, Gilles Pagès. Unconstrained Recursive Importance Sampling. Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2010, 20 (3), 1029-1067 ; ⟨10.1214/09-AAP650⟩. ⟨hal-00293466v3⟩



Record views


Files downloads