Coreset Markov Chain Monte Carlo
Not on the map. Why?
Abstract (arXiv)
A Bayesian coreset is a small, weighted subset of data that replaces the full dataset during inference in order to reduce computational cost. However, state of the art methods for tuning coreset weights are expensive, require nontrivial user input, and impose constraints on the model. In this work, we propose a new method -- Coreset MCMC -- that simulates a Markov chain targeting the coreset posterior, while simultaneously updating the coreset weights using those same draws. Coreset MCMC is simple to implement and tune, and can be used with any existing MCMC kernel. We analyze Coreset MCMC in a representative setting to obtain key insights about the convergence behaviour of the method. Empirical results demonstrate that Coreset MCMC provides higher quality posterior approximations and reduced computational cost compared with other coreset construction methods. Further, compared with other general subsampling MCMC methods, we find that Coreset MCMC has a higher sampling efficiency with competitively accurate posterior approximations.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 16 of its 51 references that are in the map. First posted on arXiv 25 Oct 2023.
Builds on
16 of 51 references.
References · 16
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 343
- 2019Rank-normalization, folding, and localization: An improved widehatR for assessing convergence of MCMCcited by 93
- 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
- 2020Variance-Reduced Methods for Machine Learningcited by 79
- 2018Bayesian Coreset Construction via Greedy Iterative Geodesic Ascentcited by 68
- 2019Stochastic gradient Markov chain Monte Carlocited by 56
- 2017Automated Scalable Bayesian Inference via Hilbert Coresetscited by 55
- 2015On Markov chain Monte Carlo methods for tall datacited by 50
- 2019Sparse Variational Inference: Bayesian Coresets from Scratchcited by 28
- 2013Austerity in MCMC Land: Cutting the Metropolis-Hastings Budgetcited by 24
- 2014Firefly Monte Carlo: Exact MCMC with Subsets of Datacited by 23
- 2014Speeding Up MCMC by Efficient Data Subsamplingcited by 18
4 more
- 2022Bayesian inference via sparse Hamiltonian flowscited by 12
- 2022Fast Bayesian Coresets via Subsampling and Quasi-Newton Refinementcited by 9
- 2018Subsampling MCMC - An introduction for the survey statisticiancited by 7
- 2017sgmcmc: An R Package for Stochastic Gradient Markov Chain Monte Carlocited by 3
Built on by
Citing papers per year: 2024: 3; 2025: 1; 2026: 1.
5 papers.
- 2024General bounds on the quality of Bayesian coresetscited by 2
- 2024MCMC-driven learningcited by 0
- 2024Tuning-Free Coreset Markov Chain Monte Carlo via Hot DoGcited by 0
- 2025Efficient MCMC Sampling with Expensive-to-Compute and Irregular Likelihoodscited by 0
- 2026Neural-Inspired Posterior Approximation (NIPA)cited by 0
- 2026Neural-Inspired Posterior Approximation (NIPA)30 Jan 2026
- 2025Efficient MCMC Sampling with Expensive-to-Compute and Irregular Likelihoods15 May 2025
- 2024Tuning-Free Coreset Markov Chain Monte Carlo via Hot DoG24 Oct 2024
- 2024General bounds on the quality of Bayesian coresets20 May 2024
- 2024MCMC-driven learning14 Feb 2024