Unbiasedness of some generalized adaptive multilevel splitting algorithms
From MaRDI portal
Abstract: We introduce a generalization of the Adaptive Multilevel Splitting algorithm in the discrete time dynamic setting, namely when it is applied to sample rare events associated with paths of Markov chains. By interpreting the algorithm as a sequential sampler in path space, we are able to build an estimator of the rare event probability (and of any non-normalized quantity associated with this event) which is unbiased, whatever the choice of the importance function and the number of replicas. This has practical consequences on the use of this algorithm, which are illustrated through various numerical experiments.
Recommendations
- Analysis of adaptive multilevel splitting algorithms in an idealized case
- Statistical behaviour of adaptive multilevel splitting algorithms in simple models
- On the asymptotic normality of adaptive multilevel splitting
- Adaptive multilevel splitting: historical perspective and recent results
- Large deviations principle for the Adaptive Multilevel Splitting Algorithm in an idealized setting
- scientific article; zbMATH DE number 1069510
- A large deviations perspective on the efficiency of multilevel splitting
- On multilevel best linear unbiased estimators
- Unbiased estimators and multilevel Monte Carlo
- Adaptive unified biased estimators of parameters in linear model
Cited in
(21)- On the asymptotic normality of adaptive multilevel splitting
- Computing non-equilibrium trajectories by a deep learning approach
- Central limit theorem for adaptive multilevel splitting estimators in an idealized setting
- Application of adaptive multilevel splitting to high-dimensional dynamical systems
- Collapse of transitional wall turbulence captured using a rare events algorithm
- Unbiased simulation of rare events in continuous time
- Adaptive multilevel splitting: historical perspective and recent results
- Sampling Conditionally on a Rare Event via Generalized Splitting
- On a new class of score functions to estimate tail probabilities of some stochastic processes with adaptive multilevel splitting
- Limit theorems for cloning algorithms
- Statistical behaviour of adaptive multilevel splitting algorithms in simple models
- Large deviations principle for the Adaptive Multilevel Splitting Algorithm in an idealized setting
- Optimizing Weighted Ensemble Sampling of Steady States
- Coupling rare event algorithms with data-based learned committor functions using the analogue Markov chain
- Analysis of adaptive multilevel splitting algorithms in an idealized case
- Reduction of a stochastic model of gene expression: Lagrangian dynamics gives access to basins of attraction as cell types and metastabilty
- Computing return times or return periods with rare event algorithms
- Adaptive Importance Sampling Based on Fault Tree Analysis for Piecewise Deterministic Markov Process
- Numerical computation of rare events via large deviation theory
- Adaptive multilevel splitting in molecular dynamics simulations
- An ergodic theorem for the weighted ensemble method
This page was built for publication: Unbiasedness of some generalized adaptive multilevel splitting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511481)
