Do Mice Grok? Glimpses of Hidden Progress During Overtraining in Sensory Cortex
Not on the map. Why?
Abstract (arXiv)
Does learning of task-relevant representations stop when behavior stops changing? Motivated by recent theoretical advances in machine learning and the intuitive observation that human experts continue to learn from practice even after mastery, we hypothesize that task-specific representation learning can continue, even when behavior plateaus. In a novel reanalysis of recently published neural data, we find evidence for such learning in posterior piriform cortex of mice following continued training on a task, long after behavior saturates at near-ceiling performance ("overtraining"). This learning is marked by an increase in decoding accuracy from piriform neural populations and improved performance on held-out generalization tests. We demonstrate that class representations in cortex continue to separate during overtraining, so that examples that were incorrectly classified at the beginning of overtraining can abruptly be correctly classified later on, despite no changes in behavior during that time. We hypothesize this hidden yet rich learning takes the form of approximate margin maximization; we validate this and other predictions in the neural data, as well as build and interpret a simple synthetic model that recapitulates these phenomena. We conclude by showing how this model of late-time feature learning implies an explanation for the empirical puzzle of overtraining reversal in animal learning, where task-specific representations are more robust to particular task changes because the learned features can be reused.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 76 references that are in the map. First posted on arXiv 5 Nov 2024.
Builds on
22 of 76 references.
References · 22
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 328
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
- 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
- 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
10 more
- 2024The Evolution of Statistical Induction Heads: In-Context Learning Markov Chainscited by 115
- 2023Explaining grokking through circuit efficiencycited by 105
- 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 104
- 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 34
- 2023Feature emergence via margin maximization: case studies in algebraic taskscited by 33
- 2022Disentanglement with Biological Constraints: A Theory of Functional Cell Typescited by 30
- 2024Information-Theoretic Progress Measures reveal Grokking is an Emergent Phase Transitioncited by 16
- 2017Blind nonnegative source separation using biological neural networkscited by 11
Built on by
Not cited yet.