paper-with-me

홈 › Papers

Egalitarian Gradient Descent: A Simple Approach to Accelerated Grokking

2025-10-06 · Ali Saheb Pasand, Elvis Dohmatob arxiv

Grokking is the phenomenon whereby, unlike the training performance, which peaks early in the training process, the test/generalization performance of a model stagnates over arbitrarily many epochs and then suddenly jumps to usually close to perfect levels. In practice, it is desirable to reduce the length of such plateaus, that is to make the learning process "grok" faster. In this work, we provide new insights into grokking. First, we show both empirically and theoretically that grokking can be induced by asymmetric speeds of (stochastic) gradient descent, along different principal (i.e singular directions) of the gradients. We then propose a simple modification that normalizes the gradients so that dynamics along all the principal directions evolves at exactly the same speed. Then, we establish that this modified method, which we call egalitarian gradient descent (EGD) and can be seen as a carefully modified form of natural gradient descent, groks much faster. In fact, in some cases the stagnation is completely removed. Finally, we empirically show that on classical arithmetic problems such as modular addition and sparse parity problem which this stagnation has been widely observed and intensively studied, that our proposed method eliminates the plateaus.

📄 PDF Abstract BibTeX arXiv:2510.04930

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Grokfast: Accelerated Grokking by Amplifying Slow Gradients

2024-05-30 · Jaerin Lee, Bong Gyun Kang, Kihoon Kim, Kyoung Mu Lee

One puzzling artifact in machine learning dubbed grokking is where delayed generalization is achieved tenfolds of iterations after near perfect overfitting to the training data. Focusing on the long delay itself on behal…

Grokking modular arithmetic

2023-01-06 · Andrey Gromov

We present a simple neural network that can learn modular arithmetic tasks and exhibits a sudden jump in generalization known as ``grokking''. Concretely, we present (i) fully-connected two-layer networks that exhibit gr…

Why Do You Grok? A Theoretical Analysis of Grokking Modular Addition

2024-07-17 · Mohamad Amin Mohamadi, Zhiyuan Li, Lei Wu, Danica J. Sutherland

We present a theoretical explanation of the ``grokking'' phenomenon, where a model generalizes long after overfitting,for the originally-studied problem of modular addition. First, we show that early in gradient descent,…

Grokking in Linear Models for Logistic Regression

2026-02-09 · Nataraj Das, Atreya Vedantam, Chandrashekar Lakshminarayanan arxiv

Grokking, the phenomenon of delayed generalization, is often attributed to the depth and compositional structure of deep neural networks. We study grokking in one of the simplest possible settings: the learning of a line…

Representation LearningBinary Classification

A geometric alternative to Nesterov's accelerated gradient descent

2015-06-26 · Sébastien Bubeck, Yin Tat Lee, Mohit Singh

We propose a new method for unconstrained optimization of a smooth and strongly convex function, which attains the optimal rate of convergence of Nesterov's accelerated gradient descent. The new algorithm has a simple ge…