Mandt, S., Hoffman, M. D., & Blei, D. M. (2017). Stochastic gradient descent as approximate Bayesian inference. Journal of Machine Learning Research, 18(134), 1–35.
Read in full in NOTE-1475.
Why this is here
The paper the owner recalled at U4 (“I think there’s a David M Blei paper that discusses this”) against A3’s claim that Bayesian posterior dominance as n grows “is not the same process” as gradient-based optimization over training time. A4 conceded the separation was “too strong”, with a limit kept here: the result relates SGD’s long-run distribution to a posterior for a fixed dataset, not training time t to sample size n. The reading bears A4’s limit out and sharpens it. The result assumes a positive-definite Hessian, so it concerns a regular model in one basin, where the posterior has no phases to order. What it maps to sample size is the optimiser’s noise scale, ε/S against 1/N (THEORY-1255). The one place examples processed map to a sample size is iterate averaging after equilibration (THEORY-1257). The record already reads this line of work through Kunin et al. (THEORY-209) and the underdamped stationary Gaussian (THEORY-779), which is this paper’s well-specified case with momentum; NOTE-293 cites this paper for McCandlish’s temperature. It grounds QUESTION-363. Its precursor is LIT-1899.