Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2102.00200

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2102.00200 (cs)
[Submitted on 30 Jan 2021 ]

Title: Linear Frequency Principle Model to Understand the Absence of Overfitting in Neural Networks

Title: 线性频率原则模型以理解神经网络中过拟合的缺失

Authors:Yaoyu Zhang, Tao Luo, Zheng Ma, Zhi-Qin John Xu
Abstract: Why heavily parameterized neural networks (NNs) do not overfit the data is an important long standing open question. We propose a phenomenological model of the NN training to explain this non-overfitting puzzle. Our linear frequency principle (LFP) model accounts for a key dynamical feature of NNs: they learn low frequencies first, irrespective of microscopic details. Theory based on our LFP model shows that low frequency dominance of target functions is the key condition for the non-overfitting of NNs and is verified by experiments. Furthermore, through an ideal two-layer NN, we unravel how detailed microscopic NN training dynamics statistically gives rise to a LFP model with quantitative prediction power.
Abstract: 为什么参数高度丰富的神经网络(NNs)不会过拟合数据是一个重要的长期悬而未决的问题。我们提出了一种神经网络训练的表观模型来解释这一不过拟合的谜题。我们的线性频率原则(LFP)模型解释了神经网络的一个关键动态特征:它们首先学习低频,而不管微观细节如何。基于我们LFP模型的理论表明,目标函数的低频主导是神经网络不过拟合的关键条件,并通过实验得到了验证。此外,通过一个理想的两层NN,我们揭示了详细的微观NN训练动力学如何统计上导致一个具有定量预测能力的LFP模型。
Comments: to appear in Chinese Physics Letters
Subjects: Machine Learning (cs.LG) ; Data Analysis, Statistics and Probability (physics.data-an)
Cite as: arXiv:2102.00200 [cs.LG]
  (or arXiv:2102.00200v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2102.00200
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1088/0256-307X/38/3/038701
DOI(s) linking to related resources

Submission history

From: Zhiqin Xu [view email]
[v1] Sat, 30 Jan 2021 10:11:37 UTC (92 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2021-02
Change to browse by:
cs
physics
physics.data-an

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号