Unconstrained Recursive Importance Sampling

Details Unconstrained Recursive Importance Sampling Unconstrained Recursive Importance Sampling

2008-07-04

arxiv.org/abs/0807.0762v3

Mathematics

Probability

30p

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Unconstrained Recursive Importance Sampling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unconstrained Recursive Importance Sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unconstrained Recursive Importance Sampling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-598065