paper-with-me

Papers

Coreset Markov Chain Monte Carlo

2023-10-25 · Naitong Chen, Trevor Campbell

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.

📄 PDF Abstract BibTeX arXiv:2310.17063

Code (1)

naitongchen/coreset-mcmc-experiments 공식 구현

Similar Papers 제목 키워드 기반

Tuning-Free Coreset Markov Chain Monte Carlo via Hot DoG

2024-10-24 · Naitong Chen, Jonathan H. Huggins, Trevor Campbell

A Bayesian coreset is a small, weighted subset of a data set that replaces the full data during inference to reduce computational cost. The state-of-the-art coreset construction algorithm, Coreset Markov chain Monte Carl…

Stochastic Optimization

MCMC-driven learning

2024-02-14 · Alexandre Bouchard-Côté, Trevor Campbell, Geoff Pleiss, Nikola Surjanovic

This paper is intended to appear as a chapter for the Handbook of Markov Chain Monte Carlo. The goal of this chapter is to unify various problems at the intersection of Markov chain Monte Carlo (MCMC) and machine learnin…

Variational Inference

Interacting Particle Markov Chain Monte Carlo

2016-02-16 · Tom Rainforth, Christian A. Naesseth, Fredrik Lindsten, Brooks Paige 외

We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain…

Curved Markov Chain Monte Carlo for Network Learning

2021-10-07 · John Sigbeku, Emil Saucan, Anthea Monod

We present a geometrically enhanced Markov chain Monte Carlo sampler for networks based on a discrete curvature measure defined on graphs. Specifically, we incorporate the concept of graph Forman curvature into sampling …

Practical bounds on the error of Bayesian posterior approximations: A nonasymptotic approach

2018-09-25 · Jonathan H. Huggins, Trevor Campbell, Mikołaj Kasprzak, Tamara Broderick

Bayesian inference typically requires the computation of an approximation to the posterior distribution. An important requirement for an approximate Bayesian inference algorithm is to output high-accuracy posterior mean …

Bayesian InferenceVariational Inference