On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling
ACM Transactions on Modeling and Computer Simulation · 2012-08 · 22 (3) · 1-27
DOI: 10.1145/2331140.2331141 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Modeling and Computer Simulation, 2012-08. Verfasst von Jose Blanchet und 2 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 29 Literaturangaben. Gefördert von: Division of Mathematical Sciences, Division of Civil, Mechanical and Manufacturing Innovation.
Abstract (Originalsprache)
In this article we explain some connections between Lyapunov methods and subsolutions of an associated Isaacs equation for the design of efficient importance sampling schemes. As we shall see, subsolutions can be derived by taking an appropriate limit of an associated Lyapunov inequality. They have been recently proposed in several works of Dupuis, Wang, and others and applied to address several important problems in rare-event simulation. Lyapunov inequalities have been used for testing the efficiency of state-dependent importance sampling schemes in heavy-tailed or discrete settings in a variety of works by Blanchet, Glynn, and others. While subsolutions provide an analytic criterion for the construction of efficient samplers, Lyapunov inequalities are useful for finding more precise information, in the form of bounds, for the behavior of the coefficient of variation of the associated importance sampling estimator in the prelimit. In addition, Lyapunov inequalities provide insight into the various mollification procedures that are often required in constructing associated subsolutions. Our aim is to demonstrate that applying Lyapunov inequalities for verification of efficiency can help both guide the selection of various mollification parameters and sharpen the information on the efficiency gain induced by the sampler.
Förderung
- Division of Mathematical Sciences
- Division of Civil, Mechanical and Manufacturing Innovation
Zitieren
APA
Blanchet, J., Glynn, P., & Leder, K. (2012). On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling. ACM Transactions on Modeling and Computer Simulation, 22(3), 1-27. https://doi.org/10.1145/2331140.2331141
Vancouver
Blanchet J, Glynn P, Leder K. On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling. ACM Transactions on Modeling and Computer Simulation. 2012;22(3):1-27. doi:10.1145/2331140.2331141
BibTeX
@article{Blanchet2012,
author = {Blanchet, Jose and Glynn, Peter and Leder, Kevin},
title = {On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling},
journal = {ACM Transactions on Modeling and Computer Simulation},
year = {2012},
volume = {22},
number = {3},
pages = {1--27},
doi = {10.1145/2331140.2331141}
}
EUVIMED