Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Nonasymptotic bounds for suboptimal importance sampling

  • Importance sampling is a popular variance reduction method for Monte Carlo estimation, where an evident question is how to design good proposal distributions. While in most cases optimal (zero-variance) estimators are theoretically possible, in practice only suboptimal proposal distributions are available and it can often be observed numerically that those can reduce statistical performance significantly, leading to large relative errors and therefore counteracting the original intention. Previous analysis on importance sampling has often focused on asymptotic arguments that work well in a large deviations regime. In this article, we provide lower and upper bounds on the relative error in a nonasymptotic setting. They depend on the deviation of the actual proposal from optimality, and we thus identify potential robustness issues that importance sampling may have, especially in high dimensions. We particularly focus on path sampling problems for diffusion processes with nonvanishing noise, for which generating good proposals comes with additional technical challenges. We provide numerous numerical examples that support our findings and demonstrate the applicability of the derived bounds.

Export metadata

Additional Services

Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Carsten HartmannORCiD, Lorenz Richter
Document Type:Article
Parent Title (English):SIAM/ASA Journal on Uncertainty Quantification
Volume:12
Issue:2
First Page:309
Last Page:346
Year of first publication:2024
ArXiv Id:http://arxiv.org/abs/2102.09606
DOI:https://doi.org/10.1137/21M1427760
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.