English
Related papers

Related papers: Grokking in the Ising Model

200 papers

Neural networks readily learn a subset of the modular arithmetic tasks, while failing to generalize on the rest. This limitation remains unmoved by the choice of architecture and training strategies. On the other hand, an analytical…

Machine Learning · Computer Science 2024-06-06 Darshil Doshi , Tianyu He , Aritra Das , Andrey Gromov

Neural networks often exhibit emergent behavior, where qualitatively new capabilities arise from scaling up the amount of parameters, training data, or training steps. One approach to understanding emergence is to find continuous…

Machine Learning · Computer Science 2023-10-23 Neel Nanda , Lawrence Chan , Tom Lieberum , Jess Smith , Jacob Steinhardt

This paper demonstrates that grokking behavior in modular arithmetic with a modulus P in a neural network can be controlled by modifying the profile of the activation function as well as the depth and width of the model. Plotting the even…

Machine Learning · Computer Science 2024-11-11 Ahmed Salah , David Yevick

Recent work by Power et al. (2022) highlighted a surprising "grokking" phenomenon in learning arithmetic tasks: a neural net first "memorizes" the training set, resulting in perfect training accuracy but near-random test accuracy, and after…

Machine Learning · Computer Science 2024-04-03 Kaifeng Lyu , Jikai Jin , Zhiyuan Li , Simon S. Du , Jason D. Lee , Wei Hu

This paper focuses on predicting the occurrence of grokking in neural networks, a phenomenon in which perfect generalization emerges long after signs of overfitting or memorization are observed. It has been reported that grokking can only…

Machine Learning · Computer Science 2023-10-02 Pascal Jr. Tikeng Notsawo , Hattie Zhou , Mohammad Pezeshki , Irina Rish , Guillaume Dumas

Neural collapse, i.e., the emergence of highly symmetric, class-wise clustered representations, is frequently observed in deep networks and is often assumed to reflect or enable generalization. In parallel, flatness of the loss landscape…

Machine Learning · Computer Science 2026-02-05 Ting Han , Linara Adilova , Henning Petzka , Jens Kleesiek , Michael Kamp

The training dynamics of deep neural networks often defy expectations, even as these models form the foundation of modern machine learning. Two prominent examples are grokking, where test performance improves abruptly long after the…

Machine Learning · Computer Science 2026-01-28 Keitaro Sakamoto , Issei Sato

Grokking in modular arithmetic has established itself as the quintessential fruit fly experiment, serving as a critical domain for investigating the mechanistic origins of model generalization. Despite its significance, existing research…

Artificial Intelligence · Computer Science 2026-04-01 Junjie Zhang , Zhen Shen , Gang Xiong , Xisong Dong

For humans, language production and comprehension is sensitive to the hierarchical structure of sentences. In natural language processing, past work has questioned how effectively neural sequence models like transformers capture this…

Computation and Language · Computer Science 2023-05-31 Shikhar Murty , Pratyusha Sharma , Jacob Andreas , Christopher D. Manning

Spectral bias, the tendency of neural networks to learn low frequencies first, can be both a blessing and a curse. While it enhances the generalization capabilities by suppressing high-frequency noise, it can be a limitation in scientific…

Machine Learning · Computer Science 2026-05-08 Shuai Jiang , Alexey Voronin , Eric Cyr , Ben Southworth

Grokking occurs when a model achieves high training accuracy but generalization to unseen test points happens long after that. This phenomenon was initially observed on a class of algebraic problems, such as learning modular arithmetic…

Machine Learning · Statistics 2026-04-02 Marcel Tomàs Bernal , Neil Rohit Mallinar , Mikhail Belkin

Grokking typically achieves similar loss to ordinary, "steady", learning. We ask whether these different learning paths - grokking versus ordinary training - lead to fundamental differences in the learned models. To do so we compare the…

Existing accounts of grokking explain the phenomena in terms of mechanistic frameworks such as circuit efficiency or lazy-to-rich transitions. However, despite a known dependence between grokking and model size, how model capacity shapes…

Machine Learning · Computer Science 2026-05-12 Yiding Song , Hanming Ye

We design and analyze a new paradigm for building supervised learning networks, driven only by local optimization rules without relying on a global error function. Traditional neural networks with a fixed topology are made up of identical…

Adaptation and Self-Organizing Systems · Physics 2024-10-04 S. Barland , L. Gil

Neural networks sometimes exhibit grokking, a phenomenon where perfect or near-perfect performance is achieved on a validation set well after the same performance has been obtained on the corresponding training set. In this workshop paper,…

Machine Learning · Computer Science 2024-02-15 Jack Miller , Patrick Gleeson , Charles O'Neill , Thang Bui , Noam Levi

Grokking, the abrupt transition from memorization to generalisation after extended training, suggests the presence of competing solution basins with distinct statistical properties. We study this phenomenon through the lens of Singular…

Machine Learning · Statistics 2026-05-08 Ben Cullen , Sergio Estan-Ruiz , Riya Danait , Jiayi Li

The study of Deep Network (DN) training dynamics has largely focused on the evolution of the loss function, evaluated on or around train and test set data points. In fact, many DN phenomenon were first introduced in literature with that…

Machine Learning · Computer Science 2023-10-23 Ahmed Imtiaz Humayun , Randall Balestriero , Richard Baraniuk

In continual learning problems, it is often necessary to overwrite components of a neural network's learned representation in response to changes in the data stream; however, neural networks often exhibit \primacy bias, whereby early…

Machine Learning · Computer Science 2025-07-29 Clare Lyle , Gharda Sokar , Razvan Pascanu , Andras Gyorgy

Standard optimization theories struggle to explain grokking, where generalization occurs long after training convergence. While geometric studies attribute this to slow drift, they often overlook the interaction between the optimizer's…

Machine Learning · Computer Science 2026-03-17 Pratyush Acharya , Habish Dhakal

We study the well-known grokking phenomena in neural networks (NNs) using a 3-layer MLP trained on 1 k-sample subset of MNIST, with and without weight decay, and discover a novel third phase -- \emph{anti-grokking} -- that occurs very late…

Machine Learning · Computer Science 2025-06-06 Hari K. Prakash , Charles H. Martin