Free energy methods for Bayesian inference: efficient exploration of univariate Gaussian mixture posteriors

DOI10.1007/s11222-011-9257-9zbMath1252.62015arXiv1003.0428OpenAlexW2013957760MaRDI QIDQ693322

Gabriel Stoltz, Tony Lelièvre, Nicolas Chopin

Publication date: 7 December 2012

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.0428

zbMATH Keywords

importance samplingmixture modelsadaptive Markov chain Monte Carloadaptive biasing forceadaptive biasing potential

Mathematics Subject Classification ID

Related Items (19)

Efficient Numerical Algorithms for the Generalized Langevin Equation ⋮ Convergence and efficiency of adaptive importance sampling techniques with partial biasing ⋮ Optimal non-reversible linear drift for the convergence to equilibrium of a diffusion ⋮ Sparse variational Bayesian approximations for nonlinear inverse problems: applications in nonlinear elastography ⋮ Ensemble Markov Chain Monte Carlo with Teleporting Walkers ⋮ On‐line partitioning of the sample space in the regional adaptive algorithm ⋮ Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities ⋮ Analysis of an adaptive biasing force method based on self-interacting dynamics ⋮ Ensemble preconditioning for Markov chain Monte Carlo simulation ⋮ Stratification as a General Variance Reduction Method for Markov Chain Monte Carlo ⋮ Multimodal, high-dimensional, model-based, Bayesian inverse problems with applications in biomechanics ⋮ Multicanonical MCMC for sampling rare events: an illustrative review ⋮ Local and global perspectives on diffusion maps in the analysis of molecular systems ⋮ Self-healing umbrella sampling: convergence and efficiency ⋮ Partial differential equations and stochastic methods in molecular dynamics ⋮ A surrogate accelerated multicanonical Monte Carlo method for uncertainty quantification ⋮ Langevin dynamics with constraints and computation of free energy differences ⋮ Bayesian methods of representative values of variable actions ⋮ Convergence of the Wang-Landau algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trajectory averaging for stochastic approximation MCMC algorithms
• Long-time convergence of an adaptive biasing force method: the bi-channel case
• From microphysics to macrophysics. Methods and applications of statistical physics. II. Translated from the French by D. ter Haar.
• Computation of free energy differences through nonequilibrium stochastic dynamics: The reaction coordinate case
• Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
• Finite mixture and Markov switching models.
• Long-time convergence of an adaptive biasing force method
• Sequential Imputations and Bayesian Missing Data Problems
• Computational and Inferential Difficulties with Mixture Posterior Distributions
• Markov chain Monte Carlo Estimation of Classical and Dynamic Switching and Mixture Models
• Existence, uniqueness and convergence of a particle approximation for the Adaptive Biasing Force process
• Monte Carlo sampling methods using Markov chains and their applications
• A Generalized Wang–Landau Algorithm for Monte Carlo Computation
• Simulating normalizing constants: From importance sampling to bridge sampling to path sampling

This page was built for publication: Free energy methods for Bayesian inference: efficient exploration of univariate Gaussian mixture posteriors