Large-scale Uncertainty Quantification for Latent Variable Models Using Subsampling Markov Chain Monte Carlo
Not on the map. Why?
Abstract (arXiv)
Stochastic gradient Langevin dynamics combined with Gibbs updates (SGLD--Gibbs) provides a highly scalable approach to approximate Bayesian inference in latent variable models. However, it remains unclear how to tune the algorithm's hyperparameters in a principled manner to ensure the uncertainty estimates are statistically meaningful. In this work, we address this gap in tuning guidance by developing a statistical scaling limit theory for SGLD--Gibbs. We derive a joint asymptotic limit for the global parameters and latent variables under appropriate space-time rescaling. We show that global parameters converge to a diffusion-type limit, while each latent variable converges to a jump process, reflecting the use of intermittent Gibbs updates. This joint jump-diffusion structure reveals how latent-variable randomness contributes to the stationary distribution of the global parameters. We leverage our results to propose explicit guidance on hyperparameter tuning for SGLD--Gibbs that ensures meaningful uncertainty quantification. Numerical experiments show that SGLD--Gibbs with our tuning guidance leads to better parameter estimates, uncertainty quantification, and predictive performance than stochastic variational inference.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 47 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
20 of 47 references.
References · 20
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2017How to Escape Saddle Points Efficientlycited by 285
- 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 243
- 2016Automatic Differentiation Variational Inferencecited by 159
- 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 88
- 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 70
- 2020On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentrationcited by 68
- 2020Dynamical mean-field theory for stochastic gradient descent in Gaussian mixture classificationcited by 60
- 2019Stochastic gradient Markov chain Monte Carlocited by 56
- 2017Covariances, Robustness, and Variational Bayescited by 40
- 2019Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLTcited by 30
- 2023Hitting the High-Dimensional Notes: An ODE for SGD learning dynamics on GLMs and multi-index modelscited by 26
8 more
- 2024Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noisecited by 12
- 2021Efficient and Generalizable Tuning Strategies for Stochastic Gradient MCMCcited by 11
- 2024Variational Inference for Uncertainty Quantification: an Analysis of Trade-offscited by 11
- 2015Scalable MCMC for Mixed Membership Stochastic Blockmodelscited by 7
- 2022Tuning Stochastic Gradient Algorithms for Statistical Inference via Large-Sample Asymptoticscited by 4
- 2024The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithmscited by 3
- 2025Quantitative Error Bounds for Scaling Limits of Stochastic Iterative Algorithmscited by 3
- 2023Reproducible Parameter Inference Using Bagged Posteriorscited by 2
Built on by
Not cited yet.