Progress Measures for Grokking on Real-world Tasks

Satvik Golechha
5/21/2024
cs.LGcs.AI

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Grokking, a phenomenon where machine learning models generalize long after overfitting, has been primarily observed and studied in algorithmic tasks. This paper explores grokking in real-world datasets using deep neural networks for classification under the cross-entropy loss. We challenge the prevalent hypothesis that the $L_2$ norm of weights is the primary cause of grokking by demonstrating that grokking can occur outside the expected range of weight norms. To better understand grokking, we introduce three new progress measures: activation sparsity, absolute weight entropy, and approximate local circuit complexity. These measures are conceptually related to generalization and demonstrate a stronger correlation with grokking in real-world datasets compared to weight norms. Our findings suggest that while weight norms might usually correlate with grokking and our progress measures, they are not causative, and our proposed measures provide a better understanding of the dynamics of grokking.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{golechha2024progress,
  title  = {Progress Measures for Grokking on Real-world Tasks},
  author = {Satvik Golechha},
  year   = {2024},
  eprint = {2405.12755},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.12755v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.12755.svg)](https://codeofpaper.com/paper/2405.12755)

Discussion