atlas

Research map / Optimization / Implicit bias and generalization

Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks

NeurIPS 2019 · Optimization › Implicit bias and generalization · approach: Shallow ReLU network convergence · 158 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 the NTRF reference class to characterize data classifiabilitySGD-trained deep ReLU networks · NTRF reference classexpected 0-1 error bound: \tilde\cO(n^{-1/2})Helped
Apply the bound under the comparison paper's margin assumptionsSGD-trained deep ReLU networks · NTRF reference class, small-error settingsample complexity: \tilde\cO(\epsilon^{-2}) versus \tilde\cO( \mathrm{poly}(2^L,\gamma^{-1}) \cdot \epsilon^{-4} )Helped
Include gradients from all network layers in the NTK referenceSGD-trained deep ReLU networks · NTK training dataexpected 0-1 error boundHelped
Allow the first-layer gradient features in the two-layer NTRF reference classTwo-layer SGD-trained ReLU networks · Two-layer reference function classgeneralization boundHelped

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