Analysis and optimization of weighted ensemble sampling
arXiv:1609.05887 · doi:10.1051/m2an/2017046
Abstract
We give a mathematical framework for weighted ensemble (WE) sampling, a binning and resampling technique for efficiently computing probabilities in molecular dynamics. We prove that WE sampling is unbiased in a very general setting that includes adaptive binning. We show that when WE is used for stationary calculations in tandem with a coarse model, the coarse model can be used to optimize the allocation of replicas in the bins.
22 pages, 3 figures
References in corpus (2)
Cited by in corpus (8)
- Optimizing weighted ensemble sampling of steady states
- Weighted ensemble: Recent mathematical developments
- Efficiently Sampling Conformations and Pathways Using the Concurrent Adaptive Sampling (CAS) Algorithm
- An ergodic theorem for the weighted ensemble method
- Accelerated estimation of long-timescale kinetics by combining weighted ensemble simulation with Markov model "microstates" using non-Markovian theory
- Optimal input potential functions in the interacting particle system method
- A splitting method to reduce MCMC variance
- Generalizing Parallel Replica Dynamics: Trajectory Fragments, Asynchronous Computing, and PDMPs