Langevin diffusions and Metropolis-Hastings algorithms

DOI10.1023/A:1023562417138zbMath1033.65003OpenAlexW1556278552MaRDI QIDQ1398011

Gareth O. Roberts, Osnat Stramer

Publication date: 6 August 2003

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023562417138

zbMATH Keywords

algorithmsstabilitystochastic differential equationrobustnessnumerical examplesMetropolis-Hastings algorithmEuler discretizationMarkov chain Monte Carlo techniqueLangevin diffusionsOzaki discretization

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Diffusion processes (60J60) Stochastic partial differential equations (aspects of stochastic analysis) (60H15) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical solutions to stochastic differential and integral equations (65C30)

Related Items (61)

Information-geometric Markov chain Monte Carlo methods using diffusions ⋮ Oracle lower bounds for stochastic gradient sampling algorithms ⋮ Variance reduction using nonreversible Langevin samplers ⋮ Proximal Markov chain Monte Carlo algorithms ⋮ Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN ⋮ Dimension-independent likelihood-informed MCMC ⋮ Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels ⋮ A Multiscale Strategy for Bayesian Inference Using Transport Maps ⋮ Constrained ensemble Langevin Monte Carlo ⋮ Markov Chain Importance Sampling—A Highly Efficient Estimator for MCMC ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical models: local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs ⋮ Unnamed Item ⋮ On sampling from a log-concave density using kinetic Langevin diffusions ⋮ The stationary distribution of allele frequencies when selection acts at unlinked loci ⋮ ALMOND: Adaptive Latent Modeling and Optimization via Neural Networks and Langevin Diffusion ⋮ A comparative evaluation of stochastic-based inference methods for Gaussian process models ⋮ Adaptive schemes for piecewise deterministic Monte Carlo algorithms ⋮ Gradient-based adaptive importance samplers ⋮ Efficient Bayes inference in neural networks through adaptive importance sampling ⋮ A reduced-rank approach to predicting multiple binary responses through machine learning ⋮ Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs ⋮ Accelerating inference for stochastic kinetic models ⋮ Zero variance differential geometric Markov chain Monte Carlo algorithms ⋮ Unbiased Estimation Using Underdamped Langevin Dynamics ⋮ Self-Supervised Deep Learning for Image Reconstruction: A Langevin Monte Carlo Approach ⋮ CUQIpy: I. Computational uncertainty quantification for inverse problems in Python ⋮ Metropolis-Hastings algorithms with acceptance ratios of nearly 1 ⋮ Bayesian prediction of jumps in large panels of time series data ⋮ Modified Cholesky Riemann manifold Hamiltonian Monte Carlo: exploiting sparsity for fast sampling of high-dimensional targets ⋮ Parallel hierarchical sampling: a general-purpose interacting Markov chains Monte Carlo algorithm ⋮ Sparse regression learning by aggregation and Langevin Monte-Carlo ⋮ Subsampling sequential Monte Carlo for static Bayesian models ⋮ Controlled sequential Monte Carlo ⋮ Langevin diffusions and the Metropolis-adjusted Langevin algorithm ⋮ Langevin Diffusion for Population Based Sampling with an Application in Bayesian Inference for Pharmacodynamics ⋮ Bayesian Spatio-Dynamic Modeling in Cell Motility Studies: Learning Nonlinear Taxic Fields Guiding the Immune Response ⋮ Bayesian Inference Based on Stationary Fokker-Planck Sampling ⋮ Locally adaptive smoothing with Markov random fields and shrinkage priors ⋮ Langevin diffusions on the torus: estimation and applications ⋮ Subgeometric ergodicity of strong Markov processes ⋮ A note on convergence rate of a linearization method for the discretization of stochastic differential equations ⋮ User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient ⋮ Optimal scaling for partially updating MCMC algorithms ⋮ Measuring sample quality with diffusions ⋮ Particle Metropolis-Hastings using gradient and Hessian information ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ Non-asymptotic guarantees for sampling by stochastic gradient descent ⋮ Is there an analog of Nesterov acceleration for gradient-based MCMC? ⋮ Adaptive independent Metropolis-Hastings ⋮ Affine Invariant Interacting Langevin Dynamics for Bayesian Inference ⋮ Adaptive Step Size Selection for Hessian-Based Manifold Langevin Samplers ⋮ Solution of the inverse scattering problem from inhomogeneous media using affine invariant sampling ⋮ Particle diffusion Monte Carlo (PDMC) ⋮ Geometric adaptive Monte Carlo in random environment ⋮ Unnamed Item ⋮ Irreversible samplers from jump and continuous Markov processes ⋮ Entropy-SGD: biasing gradient descent into wide valleys ⋮ Ensemble Kalman Sampler: Mean-field Limit and Convergence Analysis ⋮ Intrinsic modeling of stochastic dynamical systems using empirical geometry

This page was built for publication: Langevin diffusions and Metropolis-Hastings algorithms