arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.08798cs.LG
收藏

通过有效的影响估计从优化的角度理解优化

Understanding Memorization from the Perspective of Optimization via Efficient Influence Estimation

EPFL(洛桑联邦理工学院)

Futong Liu, Tao Lin, Martin Jaggi

摘要:

过度参数化的深度神经网络能够在保持小的泛化误差的同时实现出色的训练精度。人们还发现,它们能够适应任意的标签,这种行为被称为记忆现象。在这项工作中,我们研究了记忆与翻转脱落,一个有效的方法来估计影响和记忆的现象,为数据与真实标签(真实数据)和数据与随机标签(随机数据)。我们的主要发现是:(i)对于真实数据和随机数据,简单例子的优化(例如,真实数据)和困难的例子(例如,随机数据)由网络同时进行,简单的速度更快;(ii)对于真实数据,训练数据集中正确的困难示例比简单示例信息量更大。通过展示随机数据和真实数据记忆的存在,我们强调了它们之间关于优化的一致性,并强调了记忆在优化过程中的意义。

英文摘要:

Over-parameterized deep neural networks are able to achieve excellent training accuracy while maintaining a small generalization error. It has also been found that they are able to fit arbitrary labels, and this behaviour is referred to as the phenomenon of memorization. In this work, we study the phenomenon of memorization with turn-over dropout, an efficient method to estimate influence and memorization, for data with true labels (real data) and data with random labels (random data). Our main findings are: (i) For both real data and random data, the optimization of easy examples (e.g., real data) and difficult examples (e.g., random data) are conducted by the network simultaneously, with easy ones at a higher speed; (ii) For real data, a correct difficult example in the training dataset is more informative than an easy one. By showing the existence of memorization on random data and real data, we highlight the consistency between them regarding optimization and we emphasize the implication of memorization during optimization.

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

↑