The Barker Proposal: Combining Robustness and Efficiency in Gradient-Based MCMC
From MaRDI portal
Cited in
(14)- Barker's algorithm for Bayesian inference with intractable likelihoods
- Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
- Gradient-Based Markov Chain Monte Carlo for Bayesian Inference With Non-differentiable Priors
- An asymptotic Peskun ordering and its application to lifted samplers
- Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
- Sampling using adaptive regenerative processes
- Gibbs Sampling Using Anti-Correlation Gaussian Data Augmentation, with Applications to L1-Ball-Type Models
- Optimal design of the Barker proposal and other locally balanced Metropolis-Hastings algorithms
- Averaging polyhazard models using piecewise deterministic Monte Carlo with applications to data with long-term survivors
- Scalable couplings for the random walk Metropolis algorithm
- Optimal scaling results for Moreau-Yosida Metropolis-adjusted Langevin algorithms
- Delayed rejection Hamiltonian Monte Carlo for sampling multiscale distributions
- Theoretical guarantees for lifted samplers
- Scalability of Metropolis-within-Gibbs schemes for high-dimensional Bayesian models
This page was built for publication: The Barker Proposal: Combining Robustness and Efficiency in Gradient-Based MCMC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869199)