mlsanityData to 7 Oct 2026

Learning to Explore for Stochastic Gradient MCMC

arXiv 2408.09140 ↗First posted 17 Aug 2024cs.LG cs.AI cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

Bayesian Neural Networks(BNNs) with high-dimensional parameters pose a challenge for posterior inference due to the multi-modality of the posterior distributions. Stochastic Gradient MCMC(SGMCMC) with cyclical learning rate scheduling is a promising solution, but it requires a large number of sampling steps to explore high-dimensional multi-modal posteriors, making it computationally expensive. In this paper, we propose a meta-learning strategy to build glssgmcmc which can efficiently explore the multi-modal target distributions. Our algorithm allows the learned SGMCMC to quickly explore the high-density region of the posterior landscape. Also, we show that this exploration property is transferrable to various tasks, even for the ones unseen during a meta-training stage. Using popular image classification benchmarks and a variety of downstream tasks, we demonstrate that our method significantly improves the sampling efficiency, achieving better performance than vanilla glssgmcmc without incurring significant computational overhead.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 43 references that are in the map. First posted on arXiv 17 Aug 2024.

Builds on

27 of 43 references.

References · 27

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  2. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  3. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  4. 2016Variational Inference: A Review for Statisticianscited by 1,466
  5. 2017Enhancing The Reliability of Out-of-distribution Image Detection in Neural Networkscited by 1,325
  6. 2016Learning to learn by gradient descent by gradient descentcited by 616
  7. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  8. 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
  9. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
  10. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  11. 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 207
  12. 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
15 more
  1. 2014Qualitatively characterizing neural network optimization problemscited by 186
  2. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  3. 2015Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networkscited by 121
  4. 2018Understanding and correcting pathologies in the training of learned optimizerscited by 97
  5. 2023A Unified Theory of Diversity in Ensemble Learningcited by 71
  6. 2017Gradient Estimators for Implicit Modelscited by 58
  7. 2022VeLO: Training Versatile Learned Optimizers by Scaling Upcited by 57
  8. 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
  9. 2022On Uncertainty, Tempering, and Data Augmentation in Bayesian Classificationcited by 46
  10. 2019Filter Response Normalization Layer: Eliminating Batch Dependence in the Training of Deep Neural Networkscited by 45
  11. 2018Meta-Learning Update Rules for Unsupervised Representation Learningcited by 37
  12. 2022Practical tradeoffs between memory, compute, and performance in learned optimizerscited by 32
  13. 2021Dangers of Bayesian Model Averaging under Covariate Shiftcited by 31
  14. 2018Meta-Learning for Stochastic Gradient MCMCcited by 16
  15. 2020tfp.mcmc: Modern Markov Chain Monte Carlo Tools Built for Modern Hardwarecited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.