Sampling from Bayesian Neural Network Posteriors with Symmetric Minibatch Splitting Langevin Dynamics
Not on the map. Why?
Abstract (arXiv)
We propose a scalable kinetic Langevin dynamics algorithm for sampling parameter spaces of big data and AI applications. Our scheme combines a symmetric forward/backward sweep over minibatches with a symmetric discretization of Langevin dynamics. For a particular Langevin splitting method (UBU), we show that the resulting Symmetric Minibatch Splitting-UBU (SMS-UBU) integrator has bias O(h2 d1/2) in dimension d>0 with stepsize h>0, despite only using one minibatch per iteration, thus providing excellent control of the sampling bias as a function of the stepsize. We apply the algorithm to explore local modes of the posterior distribution of Bayesian neural networks (BNNs) and evaluate the calibration performance of the posterior predictive probabilities for neural networks with convolutional neural network architectures for classification problems on three different datasets (Fashion-MNIST, Celeb-A and chest X-ray). Our results indicate that BNNs sampled with SMS-UBU can offer significantly better calibration performance compared to standard methods of training and stochastic weight averaging.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 38 of its 76 references that are in the map. First posted on arXiv 14 Oct 2024.
Builds on
38 of 76 references.
References · 38
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
- 2019Measuring Calibration in Deep Learningcited by 443
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
- 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
- 2020Efficient and Scalable Bayesian Neural Nets with Rank-1 Factorscited by 171
26 more
- 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
- 2018Fast and Scalable Bayesian Deep Learning by Weight-Perturbation in Adamcited by 131
- 2019Modeling the Dynamics of PDE Systems with Physics-Constrained Deep Auto-Regressive Networkscited by 127
- 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
- 2022Deep Ensembles Work, But Are They Necessary?cited by 63
- 2018On sampling from a log-concave density using kinetic Langevin diffusionscited by 61
- 2019Stochastic gradient Markov chain Monte Carlocited by 56
- 2020Scaling Hamiltonian Monte Carlo Inference for Bayesian Neural Networks with Symmetric Splittingcited by 54
- 2015On Markov chain Monte Carlo methods for tall datacited by 50
- 2022Benchmarking Bayesian Deep Learning on Diabetic Retinopathy Detection Taskscited by 49
- 2019Shaping the learning landscape in neural networks around wide flat minimacited by 47
- 2019Challenges in Markov chain Monte Carlo for Bayesian neural networkscited by 43
- 2015From Facial Parts Responses to Face Detection: A Deep Learning Approachcited by 42
- 2016On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integratorscited by 35
- 2023On Efficient Training of Large-Scale Deep Learning Models: A Literature Reviewcited by 26
- 2018On the Theory of Variance Reduction for Stochastic Gradient Monte Carlocited by 19
- 2021A Bayesian neural network predicts the dissolution of compact planetary systemscited by 15
- 2023Fortuna: A Library for Uncertainty Quantification in Deep Learningcited by 14
- 2023When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?cited by 12
- 2021Wasserstein distance estimates for the distributions of numerical approximations to ergodic stochastic differential equationscited by 8
- 2023Unbiased Kinetic Langevin Monte Carlo with Inexact Gradientscited by 8
- 2024Convergence of Unadjusted Langevin in High Dimensions: Delocalization of Biascited by 4
- 2021Revisiting the Effects of Stochasticity for Hamiltonian Samplerscited by 3
- 2023Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient casecited by 3
- 2024Correction to "Wasserstein distance estimates for the distributions of numerical approximations to ergodic stochastic differential equations"cited by 2
- 2021Quantifying the mini-batching error in Bayesian inference for Adaptive Langevin dynamicscited by 1
Built on by
Citing papers per year: 2025: 4; 2026: 8.
12 papers.
- 2026Can Microcanonical Langevin Dynamics Leverage Mini-Batch Gradient Noise?cited by 6
- 2025Randomised Splitting Methods and Stochastic Gradient Descentcited by 3
- 2025A Langevin sampling algorithm inspired by the Adam optimizercited by 3
- 2025Random Reshuffling for Stochastic Gradient Langevin Dynamicscited by 2
- 2026On the Interplay of Priors and Overparametrization in Bayesian Neural Network Posteriorscited by 2
- 2026Towards E-Value Based Stopping Rules for Bayesian Deep Ensemblescited by 2
- 2026Position: The Time for Sampling Is Now! Charting a New Course for Bayesian Deep Learningcited by 1
- 2026Is the Last Layer Sufficient for Uncertainty Quantification?cited by 1
- 2025Scalable Bayesian Monte Carlo: fast uncertainty estimation beyond deep ensemblescited by 0
- 2026Kinetic Langevin Splitting Schemes for Constrained Samplingcited by 0
- 2026Accurate Large-sample Uncertainty Quantification using Stochastic Gradient Markov Chain Monte Carlocited by 0
- 2026Scalable Logistic Gaussian Process Density Regression with Kinetic Langevin Samplingcited by 0
- 2026Scalable Logistic Gaussian Process Density Regression with Kinetic Langevin Sampling7 Oct 2026
- 2026Accurate Large-sample Uncertainty Quantification using Stochastic Gradient Markov Chain Monte Carlo29 May 2026
- 2026Is the Last Layer Sufficient for Uncertainty Quantification?29 May 2026
- 2026Position: The Time for Sampling Is Now! Charting a New Course for Bayesian Deep Learning20 May 2026
- 2026Towards E-Value Based Stopping Rules for Bayesian Deep Ensembles20 Apr 2026
- 2026Kinetic Langevin Splitting Schemes for Constrained Sampling24 Mar 2026
- 2026On the Interplay of Priors and Overparametrization in Bayesian Neural Network Posteriors23 Mar 2026
- 2026Can Microcanonical Langevin Dynamics Leverage Mini-Batch Gradient Noise?6 Feb 2026
- 2025Scalable Bayesian Monte Carlo: fast uncertainty estimation beyond deep ensembles19 May 2025
- 2025A Langevin sampling algorithm inspired by the Adam optimizer26 Apr 2025
- 2025Randomised Splitting Methods and Stochastic Gradient Descent5 Apr 2025
- 2025Random Reshuffling for Stochastic Gradient Langevin Dynamics27 Jan 2025