The surrogate Gibbs-posterior of a corrected stochastic MALA: Towards uncertainty quantification for neural networks
Not on the map. Why?
Abstract (arXiv)
MALA is a popular gradient-based Markov chain Monte Carlo method to access the Gibbs-posterior distribution. Stochastic MALA (sMALA) scales to large data sets, but changes the target distribution from the Gibbs-posterior to a surrogate posterior which only exploits a reduced sample size. We introduce a corrected stochastic MALA (csMALA) with a simple correction term for which distance between the resulting surrogate posterior and the original Gibbs-posterior decreases in the full sample size while retaining scalability. In a nonparametric regression model, we prove a PAC-Bayes oracle inequality for the surrogate posterior. Uncertainties can be quantified by sampling from the surrogate posterior. Focusing on Bayesian neural networks, we analyze the diameter and coverage of credible balls for shallow neural networks and we show optimal contraction rates for deep neural networks. Our credibility result is independent of the correction and can also be applied to the standard Gibbs-posterior. A simulation study in a high-dimensional parameter space demonstrates that an estimator drawn from csMALA based on its surrogate Gibbs-posterior indeed exhibits these advantages in practice.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 38 of its 81 references that are in the map. First posted on arXiv 13 Oct 2023.
Builds on
38 of 81 references.
References · 38
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2014Deep Learning in Neural Networks: An Overviewcited by 765
- 2016Error bounds for approximations with deep ReLU networkscited by 567
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 431
- 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 329
- 2021User-friendly introduction to PAC-Bayes boundscited by 234
- 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
- 2013A General Framework for Updating Belief Distributionscited by 172
- 2019A Primer on PAC-Bayesian Learningcited by 130
- 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 125
26 more
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2015Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networkscited by 121
- 2020Tighter risk certificates for neural networkscited by 112
- 2017Convergence of Langevin MCMC in KL-divergencecited by 86
- 2018On sampling from a log-concave density using kinetic Langevin diffusionscited by 61
- 2023Generalization Bounds: Perspectives from Information Theory and PAC-Bayescited by 60
- 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
- 2018Posterior Concentration for Sparse Deep Learningcited by 50
- 2017Convergence Rates of Variational Posterior Distributionscited by 45
- 2019Variational Bayes for high-dimensional linear regression with sparse priorscited by 44
- 2020Non-convex Learning via Replica Exchange Stochastic Gradient MCMCcited by 33
- 2020Differentiable PAC-Bayes Objectives with Partially Aggregated Neural Networkscited by 29
- 2019Convergence Rates of Variational Inference in Sparse Deep Learningcited by 27
- 2020A Contour Stochastic Gradient Langevin Dynamics Algorithm for Simulations of Multi-modal Distributionscited by 26
- 2023Nonparametric regression using over-parameterized shallow ReLU neural networkscited by 24
- 2014Firefly Monte Carlo: Exact MCMC with Subsets of Datacited by 23
- 2022Non-Vacuous Generalisation Bounds for Shallow Neural Networkscited by 22
- 2017Theoretical and Computational Guarantees of Mean Field Variational Inference for Community Detectioncited by 19
- 2021Structured Stochastic Gradient MCMCcited by 12
- 2021When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpointcited by 12
- 2022Interacting Contour Stochastic Gradient Langevin Dynamicscited by 9
- 2022Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficultycited by 9
- 2019Mini-batch Metropolis-Hastings MCMC with Reversible SGLD Proposalcited by 6
- 2015PAC-Bayesian High Dimensional Bipartite Rankingcited by 4
- 2022A PAC-Bayes oracle inequality for sparse neural networkscited by 2
Built on by
Not cited yet.