paper-with-me

Papers

Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning

2023-06-14 · Nikhil Vyas, Depen Morwani, Rosie Zhao, Gal Kaplun, Sham Kakade, Boaz Barak

The success of SGD in deep learning has been ascribed by prior works to the implicit bias induced by finite batch sizes ("SGD noise"). While prior works focused on offline learning (i.e., multiple-epoch training), we study the impact of SGD noise on online (i.e., single epoch) learning. Through an extensive empirical analysis of image and language data, we demonstrate that small batch sizes do not confer any implicit bias advantages in online learning. In contrast to offline learning, the benefits of SGD noise in online learning are strictly computational, facilitating more cost-effective gradient steps. This suggests that SGD in the online regime can be construed as taking noisy steps along the "golden path" of the noiseless gradient descent algorithm. We study this hypothesis and provide supporting evidence in loss and function space. Our findings challenge the prevailing understanding of SGD and offer novel insights into its role in online learning.

📄 PDF Abstract BibTeX arXiv:2306.08590

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 제목 키워드 기반

Efficient Semi-Implicit Variational Inference

2021-01-15 · Vincent Moens, Hang Ren, Alexandre Maraval, Rasul Tutunov 외

In this paper, we propose CI-VI an efficient and scalable solver for semi-implicit variational inference (SIVI). Our method, first, maps SIVI's evidence lower bound (ELBO) to a form involving a nonlinear functional nesti…

Variational Inference

Towards The Implicit Bias on Multiclass Separable Data Under Norm Constraints

2026-03-24 · Shengping Xie, Zekun Wu, Quan Chen, Kaixu Tang arxiv

Implicit bias induced by gradient-based algorithms is essential to the generalization of overparameterized models, yet its mechanisms can be subtle. This work leverages the Normalized Steepest Descent} (NSD) framework to…

Stochastic Optimization

Unbiased Learning-to-Rank with Biased Feedback

2016-08-16 · Thorsten Joachims, Adith Swaminathan, Tobias Schnabel

Implicit feedback (e.g., clicks, dwell times, etc.) is an abundant source of data in human-interactive systems. While implicit feedback has many advantages (e.g., it is inexpensive to collect, user centric, and timely), …

counterfactualCounterfactual InferenceLearning-To-RankRetrieval

Implicit Regularization Effects of Unbiased Random Label Noises with SGD

2021-01-01 · Haoyi Xiong, Xuhong LI, Boyang Yu, Dejing Dou 외

Random label noises (or observational noises) widely exist in practical machinelearning settings. we analyze the learning dynamics of stochastic gradient descent(SGD) over the quadratic loss with unbiased label noises, a…

Simplicity bias, algorithmic probability, and the random logistic map

2023-12-31 · Boumediene Hamzi, Kamaludin Dingle

Simplicity bias is an intriguing phenomenon prevalent in various input-output maps, characterized by a preference for simpler, more regular, or symmetric outputs. Notably, these maps typically feature high-probability ou…