On the optimization and pruning for Bayesian deep learning
Not on the map. Why?
Abstract (arXiv)
The goal of Bayesian deep learning is to provide uncertainty quantification via the posterior distribution. However, exact inference over the weight space is computationally intractable due to the ultra-high dimensions of the neural network. Variational inference (VI) is a promising approach, but naive application on weight space does not scale well and often underperform on predictive accuracy. In this paper, we propose a new adaptive variational Bayesian algorithm to train neural networks on weight space that achieves high predictive accuracy. By showing that there is an equivalence to Stochastic Gradient Hamiltonian Monte Carlo(SGHMC) with preconditioning matrix, we then propose an MCMC within EM algorithm, which incorporates the spike-and-slab prior to capture the sparsity of the neural network. The EM-MCMC algorithm allows us to perform optimization and model pruning within one-shot. We evaluate our methods on CIFAR-10, CIFAR-100 and ImageNet datasets, and demonstrate that our dense model can reach the state-of-the-art performance and our sparse model perform very well compared to previously proposed pruning schemes.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 40 references that are in the map. First posted on arXiv 24 Oct 2022.
Builds on
30 of 40 references.
References · 30
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
- 2015Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networkscited by 295
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
18 more
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2020Efficient and Scalable Bayesian Neural Nets with Rank-1 Factorscited by 171
- 2019Practical Deep Learning with Bayesian Principlescited by 158
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
- 2017Deep Rewiring: Training very sparse deep networkscited by 136
- 2018Fast and Scalable Bayesian Deep Learning by Weight-Perturbation in Adamcited by 131
- 2020Dynamic Model Pruning with Feedbackcited by 125
- 2017Noisy Natural Gradient as Variational Inferencecited by 94
- 2020Bayesian Deep Learning via Subnetwork Inferencecited by 85
- 2014Bayesian linear regression with sparse priorscited by 40
- 2020Adaptive Inertia: Disentangling the Effects of Adaptive Learning Rate and Momentumcited by 40
- 2020Efficient Variational Inference for Sparse Deep Learning with Theoretical Guaranteecited by 37
- 2021Consistent Sparse Deep Learning: Theory and Computationcited by 27
- 2019Bayesian Inference for Large Scale Image Classificationcited by 18
- 2022Tackling covariate shift with node-based Bayesian neural networkscited by 8
- 2016An Ensemble EM Algorithm for Bayesian Variable Selectioncited by 2
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.