paper-with-me

홈 › Papers

Correlated Noise in Epoch-Based Stochastic Gradient Descent: Implications for Weight Variances

2023-06-08 · Marcel Kühn, Bernd Rosenow

Stochastic gradient descent (SGD) has become a cornerstone of neural network optimization, yet the noise introduced by SGD is often assumed to be uncorrelated over time, despite the ubiquity of epoch-based training. In this work, we challenge this assumption and investigate the effects of epoch-based noise correlations on the stationary distribution of discrete-time SGD with momentum, limited to a quadratic loss. Our main contributions are twofold: first, we calculate the exact autocorrelation of the noise for training in epochs under the assumption that the noise is independent of small fluctuations in the weight vector, and find that SGD noise is anti-correlated in time. Second, we explore the influence of these anti-correlations on SGD dynamics. We find that for directions with a curvature greater than a hyperparameter-dependent crossover value, the results for uncorrelated noise are recovered. However, for relatively flat directions, the weight variance is significantly reduced, and our variance prediction leads to a considerable reduction in loss fluctuations as compared to the constant weight variance assumption.

📄 PDF Abstract BibTeX arXiv:2306.05300

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Optimal Rates for $O(1)$-Smooth DP-SCO with a Single Epoch and Large Batches

2024-06-04 · Christopher A. Choquette-Choo, Arun Ganesh, Abhradeep Thakurta

In this paper we revisit the DP stochastic convex optimization (SCO) problem. For convex smooth losses, it is well-known that the canonical DP-SGD (stochastic gradient descent) achieves the optimal rate of $O\left(\frac{…

Federated Learning

Escaping Saddle Points with Stochastically Controlled Stochastic Gradient Methods

2021-03-07 · Guannan Liang, Qianqian Tong, Chunjiang Zhu, Jinbo Bi

Stochastically controlled stochastic gradient (SCSG) methods have been proved to converge efficiently to first-order stationary points which, however, can be saddle points in nonconvex optimization. It has been observed …

Towards Continuous-Time Approximations for Stochastic Gradient Descent without Replacement

2025-12-04 · Stefan Perko arxiv

Gradient optimization algorithms using epochs, that is those based on stochastic gradient descent without replacement (SGDo), are predominantly used to train machine learning models in practice. However, the mathematical…

Learning Rate Scheduling with Matrix Factorization for Private Training

2025-11-22 · Nikita P. Kalinin, Joel Daniel Andersson arxiv

We study differentially private model training with stochastic gradient descent under learning rate scheduling and correlated noise. Although correlated noise, in particular via matrix factorizations, has been shown to i…

On the Generalization Benefit of Noise in Stochastic Gradient Descent

2020-06-26 · ICML 2020 1 · Samuel L. Smith, Erich Elsen, Soham De

It has long been argued that minibatch stochastic gradient descent can generalize better than large batch gradient descent in deep neural networks. However recent papers have questioned this claim, arguing that this effe…