Almost Bayesian: The Fractal Dynamics of Stochastic Gradient Descent
Max Hennick, Stijn De Baerdemacker
TL;DR
The paper addresses how SGD dynamics relate to Bayesian inference by modeling weight diffusion as movement on a fractal loss landscape governed by the local learning coefficient $\lambda(w)$. It introduces a time-fractional Fokker-Planck formulation to capture subdiffusive SGD behavior and connects fractal dimensions to diffusion via homogenization, yielding stationary distributions that link SGD trajectories to Bayesian posteriors. The key contributions include formalizing the near-stability hypothesis, deriving relationships between LLC, spectral dimension $d_s$, and diffusion coefficients, and validating these predictions with MNIST experiments showing LLC and $d_s$ correlate with weight dynamics and generalization. This framework provides a principled explanation for how stochastic optimization and Bayesian sampling relate in high-dimensional, fractal loss landscapes, with implications for understanding hyperparameter effects and the role of adaptive optimizers in learning large models.
Abstract
We show that the behavior of stochastic gradient descent is related to Bayesian statistics by showing that SGD is effectively diffusion on a fractal landscape, where the fractal dimension can be accounted for in a purely Bayesian way. By doing this we show that SGD can be regarded as a modified Bayesian sampler which accounts for accessibility constraints induced by the fractal structure of the loss landscape. We verify our results experimentally by examining the diffusion of weights during training. These results offer insight into the factors which determine the learning process, and seemingly answer the question of how SGD and purely Bayesian sampling are related.
