Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfitting

Channel:

Subscribers:

68,700

Published on December 7, 2021 6:16:18 AM ● Video Link: https://www.youtube.com/watch?v=02KVK7MYuT4

Duration: 1:03:40

990 views

Other Videos By Simons Institute for the Theory of Computing

2021-12-08	Is Overfitting Actually Benign? On the Consistency of Interpolating Methods
2021-12-08	Universality of Neural Networks
2021-12-08	The Spectrum of Nonlinear Random Matrices for Ultra-Wide Neural Networks
2021-12-08	Exact Asymptotics and Universality for Gradient Flows and Empirical Risk Minimizers
2021-12-07	Learning Staircases
2021-12-07	Sharp Matrix Concentration
2021-12-07	Non-Parametric Convergence Rates for Plain Vanilla Stochastic Gradient Descent
2021-12-07	Self-Training Converts Weak Learners to Strong Learners in Mixture Models
2021-12-07	Graphon Neural Networks and the Transferability of Graph Neural Networks
2021-12-07	Adaptive Wavelet Distillation from DNNs and Dictionary Learning
2021-12-06	Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds, and Benign Overfitting
2021-12-06	Foundations of Computing: Scott Aaronson \| Polylogues
2021-12-04	Equivariant Machine Learning Structured Like Classical Physics
2021-12-03	Equivariant RL
2021-12-03	Symmetry Adapted Gram Spectrahedra
2021-12-03	Optimization On Tensor Network Varieties
2021-12-02	On The Polyhedral Geometry Of Pivot Rules
2021-12-02	Matrix Multiplication, And The Asymptotic Spectrum Of Tensors
2021-12-02	The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics
2021-12-02	Two Tensor Optimization Problems From Quantum Information
2021-12-01	Complexity Of Computing Complex Zeros Of Structured Polynomial Systems

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Deep Learning Theory Symposium

Frederic Koehler