Home
Talks
Publications
Outreach
Professional Services
Contact
Light
Dark
Automatic
Recent & Upcoming Talks
2021
What functions do self-attention blocks prefer to represent?
October 2021
Google
Computational Barriers For Learning Some Generalized Linear Models
September 2021
Simons Institute for the Theory of Computing, UC Berkeley
Slides
Video
Computational Complexity of Learning Neural Networks over Gaussian Marginals
July 2021
Stanford University
Computational Complexity of Learning ReLUs
April 2021
Institute for Mathematical and Statistical Innovation (IMSI)
Computational Complexity of Learning Neural Networks over Gaussian Marginals
January 2021
UW-Madison
2020
Computational Complexity of Learning Neural Networks over Gaussian Marginals
December 2020
MIT
Computational Complexity of Learning Neural Networks over Gaussian Marginals
November 2020
TTIC
Computational Complexity of Learning Neural Networks over Gaussian Marginals
November 2020
Georgia Tech
Computational Complexity of Learning Neural Networks over Gaussian Marginals
October 2020
Harvard University
Computational Complexity of Learning Neural Networks over Gaussian Marginals
October 2020
Duke University
Computational Complexity of Learning Neural Networks over Gaussian Marginals
July 2020
NYU
2019
Exploring Surrogate Losses for Learning Neural Networks
December 2019 12:00 AM
TTIC
Efficiently Learning Simple Neural Networks
September 2019 12:00 AM
University of Maryland Institute for Advanced Computer Studies
Learning Ising Models with Independent Failures
July 2019 12:00 AM
Simons Institute for the Theory of Computing, UC Berkeley
2018
Efficiently Learning Simple Neural Networks
September 2018 12:00 AM
Tsinghua University
Cite
×