Scalable Bayesian Learning with posteriors

Samuel Duffield, Kaelan Donatella, Johnathan Chiu, Phoebe Klett, Daniel Simpson
5/31/2024
cs.LGstat.ML

No official code found. Best implementation: normal-computing/posteriors (384 stars, Apache-2.0, last commit 2026-04-01).

Abstract

Although theoretically compelling, Bayesian learning with modern machine learning models is computationally challenging since it requires approximating a high dimensional posterior distribution. In this work, we (i) introduce posteriors, an easily extensible PyTorch library hosting general-purpose implementations making Bayesian learning accessible and scalable to large data and parameter regimes; (ii) present a tempered framing of stochastic gradient Markov chain Monte Carlo, as implemented in posteriors, that transitions seamlessly into optimization and unveils a minor modification to deep ensembles to ensure they are asymptotically unbiased for the Bayesian posterior, and (iii) demonstrate and compare the utility of Bayesian approximations through experiments including an investigation into the cold posterior effect and applications with large language models.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Uncertainty quantification with PyTorch

38424PythonSep 27, 20236 months agoApache-2.0

Similar Papers

Cite this paper

@article{duffield2024scalable,
  title  = {Scalable Bayesian Learning with posteriors},
  author = {Samuel Duffield and Kaelan Donatella and Johnathan Chiu and Phoebe Klett and Daniel Simpson},
  year   = {2024},
  eprint = {2406.00104},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.00104v2},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.00104.svg)](https://codeofpaper.com/paper/2406.00104)

Discussion