mlsanityData to 7 Oct 2026

Entropy-MCMC: Sampling from Flat Basins with Ease

arXiv 2310.05401 ↗First posted 9 Oct 2023cs.LG stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

Bayesian deep learning counts on the quality of posterior distribution estimation. However, the posterior of deep neural networks is highly multi-modal in nature, with local modes exhibiting varying generalization performance. Given a practical budget, targeting at the original posterior can lead to suboptimal performance, as some samples may become trapped in "bad" modes and suffer from overfitting. Leveraging the observation that "good" modes with low generalization error often reside in flat basins of the energy landscape, we propose to bias sampling on the posterior toward these flat regions. Specifically, we introduce an auxiliary guiding variable, the stationary distribution of which resembles a smoothed posterior free from sharp modes, to lead the MCMC sampler to flat basins. By integrating this guiding variable with the model parameter, we create a simple joint distribution that enables efficient sampling with minimal computational overhead. We prove the convergence of our method and further show that it converges faster than several existing flatness-aware methods in the strongly convex setting. Empirical results demonstrate that our method can successfully sample from flat basins of the posterior, and outperforms all compared baselines on multiple benchmarks including classification, calibration, and out-of-distribution detection.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 35 of its 56 references that are in the map. First posted on arXiv 9 Oct 2023.

Builds on

35 of 56 references.

References · 35

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  4. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  5. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
  6. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  7. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  8. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  9. 2017Exploring Generalization in Deep Learningcited by 595
  10. 2018Predictive Uncertainty Estimation via Prior Networkscited by 555
  11. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  12. 2017Sharp Minima Can Generalize For Deep Netscited by 462
23 more
  1. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  2. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  3. 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
  4. 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
  5. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  6. 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
  7. 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
  8. 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 85
  9. 2020On the Convergence of SGD with Biased Gradientscited by 79
  10. 2020The Case for Bayesian Deep Learningcited by 68
  11. 2019Understanding Generalization through Visualizationscited by 54
  12. 2020Scaling Hamiltonian Monte Carlo Inference for Bayesian Neural Networks with Symmetric Splittingcited by 54
  13. 2013Proximal Markov chain Monte Carlo algorithmscited by 46
  14. 2019Filter Response Normalization Layer: Eliminating Batch Dependence in the Training of Deep Neural Networkscited by 45
  15. 2016Unreasonable Effectiveness of Learning Neural Networks: From Accessible States and Robust Ensembles to Basic Algorithmic Schemescited by 40
  16. 2022SAM as an Optimal Relaxation of Bayescited by 40
  17. 2015Subdominant Dense Clusters Allow for Simple Learning and High Computational Performance in Neural Networks with Discrete Synapsescited by 39
  18. 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
  19. 2020Entropic gradient descent algorithms and wide flat minimacited by 25
  20. 2014Firefly Monte Carlo: Exact MCMC with Subsets of Datacited by 23
  21. 2020Asymptotically Optimal Exact Minibatch Metropolis-Hastingscited by 14
  22. 2016Training Recurrent Neural Networks by Diffusioncited by 8
  23. 2023Dimensionality Reduction for General KDE Mode Findingcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 3; 2025: 3.

6 papers.