MALA with annealed proposals: a generalization of locally and globally balanced proposal distributions
DOI10.1007/S11222-021-10063-1zbMath1478.62005OpenAlexW3216685853MaRDI QIDQ2066745
Mylène Bédard, Gabriel Boisvert-Beaudry
Publication date: 14 January 2022
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-021-10063-1
Markov chain Monte CarloreversibilityMetropolis-adjusted Langevin algorithmBayesian logistic regressioninformed proposal distribution
Computational methods in Markov chains (60J22) Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on Metropolis-Hastings kernels for general state spaces
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimum Monte-Carlo sampling using Markov chains
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Informed Proposals for Local MCMC in Discrete Spaces
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
This page was built for publication: MALA with annealed proposals: a generalization of locally and globally balanced proposal distributions