Poster

Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noise

Spencer Frei · Yuan Cao · Quanquan Gu

Virtual

Keywords: [ Deep Learning Theory ] [ Online Learning ] [ Fairness, Accountability, and Transparency ] [ Algorithms -> Classification; Algorithms ]

[ Abstract ]
[ Slides
[ Paper ]
[ Visit Poster at Spot C6 in Virtual World ] [ Visit Poster at Spot D4 in Virtual World ]
Wed 21 Jul 9 a.m. PDT — 11 a.m. PDT
 
Spotlight presentation: Deep Learning Theory 2
Wed 21 Jul 5 a.m. PDT — 6 a.m. PDT

Abstract:

We consider a one-hidden-layer leaky ReLU network of arbitrary width trained by stochastic gradient descent (SGD) following an arbitrary initialization. We prove that SGD produces neural networks that have classification accuracy competitive with that of the best halfspace over the distribution for a broad class of distributions that includes log-concave isotropic and hard margin distributions. Equivalently, such networks can generalize when the data distribution is linearly separable but corrupted with adversarial label noise, despite the capacity to overfit. To the best of our knowledge, this is the first work to show that overparameterized neural networks trained by SGD can generalize when the data is corrupted with adversarial label noise.

Chat is not available.