arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.20199stat.MLcs.LG
收藏

非神经模型中的涌现:通过平均梯度外积实现模算术的grokking

Emergence in non-neural models: grokking modular arithmetic via average gradient outer product

UC San Diego(圣迭戈大学);The Broad Institute of MIT and Harvard(哈佛大学与麻省理工学院 Broad 实验室);IIT Bombay(孟买印度理工学院)

Neil Mallinar, Daniel Beaglehole, Libin Zhu, Adityanarayanan Radhakrishnan, Parthe Pandit, Mikhail Belkin

AI总结:

本研究证明grokking现象不仅限于神经网络,递归特征机通过平均梯度外积学习块循环特征实现模算术,从而产生涌现,表明涌现源于任务相关特征学习。

摘要:

训练用于解决模算术任务的神经网络会表现出grokking现象,即模型在训练过程中达到100%训练准确率很久之后,测试准确率才开始提高。这通常被视为“涌现”的一个例子,即模型能力通过相变急剧显现。在本工作中,我们表明grokking现象并非神经网络或基于梯度下降的优化所特有。具体而言,我们展示了当使用递归特征机(RFM)学习模算术时也会出现该现象,RFM是一种迭代算法,利用平均梯度外积(AGOP)实现通用机器学习模型的任务特定特征学习。当与核机器结合使用时,迭代RFM会导致从随机的、接近零的测试准确率到完美测试准确率的快速转变。这种转变无法从训练损失(恒为零)或测试损失(在初始迭代中保持不变)预测。相反,正如我们所展示的,该转变完全由特征学习决定:RFM逐步学习块循环特征以解决模算术。与RFM的结果相似,我们表明解决模算术的神经网络也学习块循环特征。此外,我们提供了理论证据,表明RFM使用此类块循环特征来实现傅里叶乘法算法,先前的工作认为该算法是神经网络在这些任务上学到的泛化解。我们的结果表明,涌现可以纯粹源于学习任务相关特征,并非神经架构或基于梯度下降的优化方法所特有。此外,我们的工作为AGOP作为神经网络中特征学习的关键机制提供了更多证据。

英文摘要:

Neural networks trained to solve modular arithmetic tasks exhibit grokking, a phenomenon where the test accuracy starts improving long after the model achieves 100% training accuracy in the training process. It is often taken as an example of "emergence", where model ability manifests sharply through a phase transition. In this work, we show that the phenomenon of grokking is not specific to neural networks nor to gradient descent-based optimization. Specifically, we show that this phenomenon occurs when learning modular arithmetic with Recursive Feature Machines (RFM), an iterative algorithm that uses the Average Gradient Outer Product (AGOP) to enable task-specific feature learning with general machine learning models. When used in conjunction with kernel machines, iterating RFM results in a fast transition from random, near zero, test accuracy to perfect test accuracy. This transition cannot be predicted from the training loss, which is identically zero, nor from the test loss, which remains constant in initial iterations. Instead, as we show, the transition is completely determined by feature learning: RFM gradually learns block-circulant features to solve modular arithmetic. Paralleling the results for RFM, we show that neural networks that solve modular arithmetic also learn block-circulant features. Furthermore, we present theoretical evidence that RFM uses such block-circulant features to implement the Fourier Multiplication Algorithm, which prior work posited as the generalizing solution neural networks learn on these tasks. Our results demonstrate that emergence can result purely from learning task-relevant features and is not specific to neural architectures nor gradient descent-based optimization methods. Furthermore, our work provides more evidence for AGOP as a key mechanism for feature learning in neural networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑