Affiliation:
1. Brown University, Providence, RI
Abstract
Importance sampling is a variance reduction technique for efficient estimation of rare-event probabilities by Monte Carlo. For random variables with heavy tails there is little consensus on how to choose the change of measure used in importance sampling. In this article we study dynamic importance sampling schemes for sums of independent and identically distributed random variables with regularly varying tails. The number of summands can be random but must be independent of the summands. For estimating the probability that the sum exceeds a given threshold, we explicitly identify a class of dynamic importance sampling algorithms with bounded relative errors. In fact, these schemes are nearly asymptotically optimal in the sense that the second moment of the corresponding importance sampling estimator can be made as close as desired to the minimal possible value.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modelling and Simulation
Reference12 articles.
1. Asmussen S. 2000. Ruin Probabilities. World Scientific Singapore. Asmussen S. 2000. Ruin Probabilities. World Scientific Singapore.
2. Asmussen S. and Kroese D. 2004. Improved algorithms for rare event simulation with heavy tails. Tech. rep. The Danish National Research Foundation: Network in Mathematical Physics and Stochastics. Asmussen S. and Kroese D. 2004. Improved algorithms for rare event simulation with heavy tails. Tech. rep. The Danish National Research Foundation: Network in Mathematical Physics and Stochastics.
3. Billingsley P. 1968. Convergence of Probability Measures. John Wiley New York. Billingsley P. 1968. Convergence of Probability Measures. John Wiley New York.
4. Bingham N. Goldie C. and Teugels J. 1987. Regular Variation. Cambridge University Press Cambridge. Bingham N. Goldie C. and Teugels J. 1987. Regular Variation. Cambridge University Press Cambridge.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献