On the Cryptographic Hardness of Learning One-Hidden Layer Neural Networks

Channel:

Subscribers:

68,700

Published on December 8, 2021 9:48:54 AM ● Video Link: https://www.youtube.com/watch?v=gcjCDqt9ewg

Duration: 19:10

365 views

Other Videos By Simons Institute for the Theory of Computing

2022-01-19	Introduction to Causal Graphical Models: Graphs, d-separation, do-calculus
2022-01-19	Introduction to Causal Graphical Models: Graphs, d-separation, do-calculus
2022-01-18	Introduction to Causal Graphical Models: Graphs, d-separation, do-calculus
2021-12-15	Program Organizer Presentations
2021-12-15	Lightning Talks by Research Fellows
2021-12-15	Welcome
2021-12-15	Lightning Talks by Industry Partners
2021-12-11	Foundations for a Democratic Metaverse
2021-12-09	The Thresholding Scheme for Mean Curvature Flow and de Giorgi’s Ideas for Gradient Flows
2021-12-08	Representation Costs of Linear Neural Networks: Analysis and Design
2021-12-08	On the Cryptographic Hardness of Learning One-Hidden Layer Neural Networks
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

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Deep Learning Theory Symposium

Ilias Zadik