Affine invariant interacting Langevin dynamics in Markov chain importance sampling for rare event estimation
Jason Beh, J\'er\^ome Morio, Florian Simatos, Simon Weissmann

TL;DR
This paper introduces ALDI-IS, a new affine invariant Langevin dynamics-based importance sampling method for rare event probability estimation, providing theoretical error bounds and demonstrating the trade-off between smoothing and sampling efficiency.
Contribution
It proposes a novel affine invariant interacting Langevin dynamics scheme for importance sampling in rare event estimation, with theoretical error bounds and analysis of smoothing effects.
Findings
ALDI-IS effectively estimates rare event probabilities.
The smoothing parameter impacts sampling accuracy and efficiency.
Numerical results illustrate the trade-off between smoothing and sampling ease.
Abstract
This work considers the framework of Markov chain importance sampling~(MCIS), in which one employs a Markov chain Monte Carlo~(MCMC) scheme to sample particles approaching the optimal distribution for importance sampling, prior to estimating the quantity of interest through importance sampling. In rare event estimation, the optimal distribution admits a non-differentiable log-density, thus gradient-based MCMC can only target a smooth approximation of the optimal density. We propose a new gradient-based MCIS scheme for rare event estimation, called affine invariant interacting Langevin dynamics for importance sampling~(ALDI-IS), in which the affine invariant interacting Langevin dynamics~(ALDI) is used to sample particles according to the smoothed zero-variance density. We establish a non-asymptotic error bound when importance sampling is used in conjunction with samples independently…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbability and Risk Models · Age of Information Optimization · Distributed Sensor Networks and Detection Algorithms
