Stochastic Gradient Markov Chain Monte Carlo
From MaRDI portal
Publication:5857155
DOI10.1080/01621459.2020.1847120zbMath1457.62024arXiv1907.06986OpenAlexW3100688298MaRDI QIDQ5857155
Paul Fearnhead, Christopher Nemeth
Publication date: 30 March 2021
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.06986
Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05) Stochastic approximation (62L20)
Related Items
A Hybrid Gibbs Sampler for Edge-Preserving Tomographic Reconstruction with Uncertain View Angles, An adaptively weighted stochastic gradient MCMC algorithm for Monte Carlo simulation and global optimization, Uncertainty quantification in scientific machine learning: methods, metrics, and comparisons, CUQIpy: I. Computational uncertainty quantification for inverse problems in Python, Multi-index antithetic stochastic gradient algorithm, Efficient and generalizable tuning strategies for stochastic gradient MCMC, Asynchronous and Distributed Data Augmentation for Massive Data Settings, Optimal friction matrix for underdamped Langevin sampling, A fast and efficient Markov chain Monte Carlo method for market microstructure model, Stochastic gradient Langevin dynamics with adaptive drifts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
- The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data
- The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Method
- General state space Markov chains and MCMC algorithms
- Computable bounds for geometric convergence rates of Markov chains
- Exponential convergence of Langevin distributions and their discrete approximations
- Geometric ergodicity and hybrid Markov chains
- Optimal scaling for various Metropolis-Hastings algorithms.
- Piecewise deterministic Markov processes for continuous-time Monte Carlo
- Merging MCMC subposteriors through Gaussian-process approximations
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
- Measuring sample quality with diffusions
- Bayesian nonparametric clustering for large data sets
- Control variates for stochastic gradient MCMC
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Nonasymptotic bounds for sampling algorithms without log-concavity
- (Non-) asymptotic properties of Stochastic Gradient Langevin Dynamics
- Handbook of Markov Chain Monte Carlo
- Particle Filters for Partially Observed Diffusions
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Robust and Scalable Bayes via a Median of Subset Posterior Measures
- 10.1162/jmlr.2003.3.4-5.993
- On Choosing and Bounding Probability Metrics
- Stochastic Gradient MCMC for State Space Models
- Quasi-Stationary Monte Carlo and The Scale Algorithm
- Efficient posterior sampling for high-dimensional imbalanced logistic regression
- Equation of State Calculations by Fast Computing Machines
- The Hastings algorithm at fifty
- Speeding Up MCMC by Efficient Data Subsampling
- Monte Carlo sampling methods using Markov chains and their applications
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- A Stochastic Approximation Method
