Accurate Large-sample Uncertainty Quantification using Stochastic Gradient Markov Chain Monte Carlo
Abstract
Lay Summary
Many machine learning methods are trained using fast randomized algorithms that process only part of the data at each step. These methods are efficient, but they are hard to tune when we want reliable uncertainty estimates, not just accurate predictions. Existing theory often approximates these algorithms as if they change continuously over time, but this can be inaccurate when the algorithm uses large batches of data, larger learning rates, or imperfect statistical models. We take a different approach by studying these algorithms step by step, matching how they are actually implemented. This allows us to better predict their long-run behavior, including how variable their outputs are and how quickly they explore uncertainty. Based on this analysis, we develop practical tuning guidance for stochastic gradient methods used in uncertainty quantification. Our experiments show that the proposed approach gives more accurate uncertainty estimates than existing theory in both synthetic and real-world examples. This makes stochastic training methods more useful and trustworthy in applications where understanding uncertainty matters.