AI Paper Atlas

Research map / Optimization / Implicit bias and generalization

Asymptotics of Wide Networks from Feynman Diagrams

ICLR 2020 · Optimization › Implicit bias and generalization · approach: Gradient flow and mean-field dynamics · 51 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Feynman-diagram cluster counting to bound correlation-function scalingWide neural-network correlation functions · Fully connected networks with linear, ReLU, and tanh activationsfitted width exponentNo clear effect
Use the derived finite-width bound instead of the existing gradient-flow boundNTK change during gradient flow · Wide-network trainingwidth scaling bound: O(n^{-1/2}) -> O(n^{-1})Helped
Extend the asymptotic analysis from gradient flow to SGDWide-network training · NTK change during SGDwidth scaling bound: O(n^{-1})Helped
Use the predicted first finite-width correctionNetwork function and NTK evolution · Two-class MNISTagreement with empirical evolution: O(n^{-1})No clear effect
Replace Gaussian initialization with uniform {±1} initializationWide-network correlation functions · Three-hidden-layer networksfitted width exponentNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy