Grokfast: Accelerated Grokking by Amplifying Slow Gradients
<|reference_start|>Grokfast: Accelerated Grokking by Amplifying Slow Gradients: 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 behalf of machine learning practitioners, our goal is to accelerate generalization of a model under grokking phenomenon. By regarding a series of gradients of a parameter over training iterations as a random signal over time, we can spectrally decompose the parameter trajectories under gradient descent into two components: the fast-varying, overfitting-yielding component and the slow-varying, generalization-inducing component. This analysis allows us to accelerate the grokking phenomenon more than $\times 50$ with only a few lines of code that amplifies the slow-varying components of gradients. The experiments show that our algorithm applies to diverse tasks involving images, languages, and graphs, enabling practical availability of this peculiar artifact of sudden generalization. Our code is available at https://github.com/ironjr/grokfast.<|reference_end|>
@article{lee2024grokfast:,
    title={Grokfast: Accelerated Grokking by Amplifying Slow Gradients},
    author={Jaerin Lee, Bong Gyun Kang, Kihoon Kim, Kyoung Mu Lee},
    journal={arXiv preprint arXiv:2405.20233},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.20233},
    primaryClass={cs.LG cs.AI}
}