Hostname: page-component-74656f9884-8rzl6 Total loading time: 0 Render date: 2026-11-06T02:50:56.928Z Has data issue: false hasContentIssue false
  • English
  • Français

Moderate deviations-based importance sampling for stochastic recursive equations

Part of: Limit theorems Probabilistic methods, simulation and stochastic differential equations

Published online by Cambridge University Press:  17 November 2017

Paul Dupuis  and
Dane Johnson
Paul Dupuis*
Affiliation:
Brown University
Dane Johnson*
Affiliation:
University of North Carolina at Chapel Hill
*
* Postal address: Division of Applied Mathematics, Brown University, Box F, 182 George St., Providence, RI 02912, USA.
** Postal address: Department of Statistics and Operations Research, University of Carolina at Chapel Hill, 318 Hanes Hall, Chapel Hill, NC 27599, USA. Email address: danedane@email.unc.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Subsolutions to the Hamilton–Jacobi–Bellman equation associated with a moderate deviations approximation are used to design importance sampling changes of measure for stochastic recursive equations. Analogous to what has been done for large deviations subsolution-based importance sampling, these schemes are shown to be asymptotically optimal under the moderate deviations scaling. We present various implementations and numerical results to contrast their performance, and also discuss the circumstances under which a moderate deviation scaling might be appropriate.

Keywords

Moderate deviationsimportance samplingrare eventaccelerated Monte Carlo

MSC classification

Primary: 65C05: Monte Carlo methods
Secondary: 60F10: Large deviations

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 49 , Issue 4 , December 2017 , pp. 981 - 1010
Copyright
Copyright © Applied Probability Trust 2017 

References

[1] Anderson, B. D. O. and Moore, J. B. (2007). Optimal Control: Linear Quadratic Methods. Prentice Hall, Englewood Cliffs, NJ. Google Scholar
[2] Azencott, R. and Ruget, G. (1977). Mélanges d'équations différentielles et grands écarts à la loi des grands nombres.. Z. Wahrscheinlichkeitsth. 38, 1–54. Google Scholar
[3] Blanchet, J., Glynn, P. and Leder, K. (2012). On Lyapunov inequalities and subsolutions for efficient importance sampling. ACM Trans. Model. Comput. Simul. 22, 13. Google Scholar
[4] Blanes, S., Casas, F., Oteo, J. A. and Ros, J. (2009). The Magnus expansion and some of its applications. Phys. Rep. 470, 151–238. Google Scholar
[5] Dembo, A. and Zeitouni, O. (1993). Large Deviations Techniques and Applications. Jones and Bartlett, Boston, MA. Google Scholar
[6] Dupuis, P. and Ellis, R. S. (1997). A Weak Convergence Approach to the Theory of Large Deviations. John Wiley, New York. Google Scholar
[7] Dupuis, P. and James, M. R. (1998). Rates of convergence for approximation schemes in optimal control. SIAM J. Control Optimization 36, 719–741. Google Scholar
[8] Dupuis, P. and Johnson, D. (2015). Moderate deviations for recursive stochastic algorithms. Stoch. Systems 5, 87–119. Google Scholar
[9] Dupuis, P. and Wang, H. (2004). Importance sampling, large deviations, and differential games. Stoch. Stoch. Reports 76, 481–508. Google Scholar
[10] Dupuis, P. and Wang, H. (2007). Subsolutions of an Isaacs equation and efficient schemes for importance sampling. Math. Operat. Res. 32, 723–757. Google Scholar
[11] Dupuis, P., Leder, K. and Wang, H. (2007). Large deviations and importance sampling for a tandem network with slow-down. Queuing Systems 57, 71–83. Google Scholar
[12] Dupuis, P., Sezer, A. D. and Wang, H. (2007). Dynamic importance sampling for queueing networks. Ann. Appl. Prob 17, 1306–1346. CrossRefGoogle Scholar
[13] Dupuis, P., Spiliopoulos, K. and Wang, H. (2012). Importance sampling for multiscale diffusions. Multiscale Model. Simul. 10, 1–27. Google Scholar
[14] Dupuis, P., Spiliopoulos, K. and Zhou, X. (2015). Escaping from an attractor: importance sampling and rest points I. Ann. Appl. Prob. 25, 2909–2958. Google Scholar
[15] Freidlin, and Wentzell, (1984). Random Perturbations of Dynamical Systems. Springer, New York. Google Scholar
[16] Glasserman, P. and Wang, Y. (1997). Counterexamples in importance sampling for large deviations probabilities. Ann. Appl. Prob. 7, 731–746. Google Scholar
[17] Joffe, A. and Métivier, M. (1986). Weak convergence of sequences of semimartingales with applications to multitype branching processes. Adv. Appl. Prob. 18, 20–65. Google Scholar
[18] Johnson, D. (2015). Moderate deviations and subsolution-based importance sampling for recursive stochastic algorithms. Doctoral thesis. Brown University. Google Scholar
[19] Siegmund, D. (1976). Importance sampling in the Monte Carlo study of sequential tests. Ann. Statist. 4, 673–684. Google Scholar
[20] Ventsel', A. D. (1976). Rough limit theorems on large deviations for Markov stochastic processes. I. Theory Prob. Appl. 21, 227–242. Google Scholar
[21] Ventsel', A. D. (1976). Rough limit theorems on large deviations for Markov stochastic processes. II. Theory Prob. Appl. 21, 499–512. CrossRefGoogle Scholar
[22] Ventsel', A. D. (1979). Rough limit theorems on large deviations for Markov stochastic processes. III. Theory Prob. Appl. 24, 675–692. CrossRefGoogle Scholar
[23] Ventsel', A. D. (1982). Rough limit theorems on large deviations for Markov stochastic processes. IV. Theory Prob. Appl. 27, 215–234. Google Scholar