Ensemble preconditioning for Markov chain Monte Carlo simulation
From MaRDI portal
(Redirected from Publication:1702007)
Abstract: We describe parallel Markov chain Monte Carlo methods that propagate a collective ensemble of paths, with local covariance information calculated from neighboring replicas. The use of collective dynamics eliminates multiplicative noise and stabilizes the dynamics thus providing a practical approach to difficult anisotropic sampling problems in high dimensions. Numerical experiments with model problems demonstrate that dramatic potential speedups, compared to various alternative schemes, are attainable.
Recommendations
Cites work
- scientific article; zbMATH DE number 2114382 (Why is no real title available?)
- scientific article; zbMATH DE number 3088537 (Why is no real title available?)
- A general purpose sampling algorithm for continuous distributions (the t-walk)
- A stochastic Newton MCMC method for large-scale statistical inverse problems with application to seismic inversion
- Accelerating Gaussian diffusions
- Accelerating diffusions
- An adaptive Metropolis algorithm
- Convergence of adaptive direction sampling
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- Ensemble samplers with affine invariance
- Free energy methods for Bayesian inference: efficient exploration of univariate Gaussian mixture posteriors
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Improved diffusion Monte Carlo
- Irreversible Langevin samplers and variance reduction: a large deviations approach
- MCMC using Hamiltonian dynamics
- Metropolis integration schemes for self-adjoint diffusions
- Molecular dynamics. With deterministic and stochastic numerical methods
- Optimization theory and methods. Nonlinear programming
- Pathwise accuracy and ergodicity of metropolized integrators for SDEs
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
- Stochastic processes and applications. Diffusion processes, the Fokker-Planck and Langevin equations
- The computation of averages from equilibrium and nonequilibrium Langevin molecular dynamics
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Variance reduction using nonreversible Langevin samplers
Cited in
(27)- Ensemble slice sampling. Parallel, black-box and gradient-free inference for correlated \& multimodal distributions
- Affine invariant interacting Langevin dynamics for Bayesian inference
- Calibrate, emulate, sample
- A new bi-fidelity model reduction method for Bayesian inverse problems
- Sequential Kalman tuning of the \(t\)-preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems
- Ensemble samplers with affine invariance
- Ensemble inference methods for models with noisy and expensive likelihoods
- Consensus‐based sampling
- Preconditioning Markov Chain Monte Carlo Simulations Using Coarse-Scale Models
- The parallel replica method for computing equilibrium averages of Markov chains
- Interacting Langevin diffusions: gradient structure and ensemble Kalman sampler
- Derivative-Free Bayesian Inversion Using Multiscale Dynamics
- EnsembleQN
- Fokker-Planck particle systems for Bayesian inference: computational approaches
- Extended ensemble Monte Carlo approach to hardly relaxing problems
- Covariance-modulated optimal transport and gradient flows
- Potential-decomposition strategy in Markov chain Monte Carlo sampling algorithms
- Efficient derivative-free Bayesian inference for large-scale inverse problems
- Constructing sampling schemes via coupling: Markov semigroups and optimal transport
- Affine-invariant ensemble transform methods for logistic regression
- Constrained ensemble Langevin Monte Carlo
- scientific article; zbMATH DE number 7307488 (Why is no real title available?)
- Ensemble Markov chain Monte Carlo with teleporting walkers
- Using perturbed underdamped Langevin dynamics to efficiently sample from probability distributions
- Ensemble Monte Carlo calculations with five novel moves
- Ensemble transport adaptive importance sampling
- Iterated Kalman methodology for inverse problems
This page was built for publication: Ensemble preconditioning for Markov chain Monte Carlo simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702007)
