This workshop is being live streamed on our website. Full participation (including the capacity to ask questions) will be available via Zoom webinar. 

All talk times are in Pacific Time. 

–
Coffee and Check-In
–
Opening Remarks
–
Testing Monotonicity of Distributions Over High-Dimensional Posets
Maryam Aliakbarpour (University of Massachusetts Amherst)
–
VC Dimension and Distribution-Free Sample-Based Testing
Eric Blais (University of Waterloo)
–
Break
–
Testing Noisy Linear Functions for Sparsity
Rocco Servedio (Columbia University)
–
Break
–
Reduction From Non-Unique Games to Boolean Unique Games
Dana Moshkovitz (University of Texas, Austin)
–
Break
–
Learning Ising Models from One, Ten or a Thousand Samples
Costis Daskalakis (MIT)
–
Learning and Testing for Gradient Descent
Emmanuel Abbe (EPFL)
–
Counting and Sampling Subgraphs in Sublinear Time
Talya Eden (MIT)
–
Break
–
Low-Degree Hardness of Random Optimization Problems
Alex Wein (New York University)
–
Break
–
Phase Transitions for Detecting Latent Geometry in Random Graphs
Dheeraj Nagaraj (MIT)
–
Break
–
Recent Progress in Algorithmic Robust Statistics via the Sum-of-Squares Method
Pravesh Kothari (CMU)
–
SGD Learns One-Layer Networks in WGANs
Qi Lei (Princeton University)
–
Analyzing Optimization and Generalization in Deep Learning via Dynamics of Gradient Descent
Nadav Cohen (Tel-Aviv University)
–
Break
–
The Surprising Simplicity of the Early-Time Learning Dynamics of Neural Networks in High Dimension
Wei Hu (Princeton University)
–
Break
–
Learning Deep ReLU Networks is Fixed-Parameter Tractable
Sitan Chen (MIT)
–
Directed Graphical Models for Extreme Value Statistics
Ngoc Tran (University of Texas, Austin)
–
Learning Some Ill-Conditioned Gaussian Graphical Models
Raghu Meka (UCLA)
–
Break
–
Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu
Eric Price (University of Texas, Austin)
–
Break
–
Hardness of Identity Testing for Potts models and RBMs
Antonio Blanca (Penn State)
–
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models
Daniel Kane (UCSD)
–
An Equivalence Between Private Classification and Online Prediction
Shay Moran (Technion)
–
Break
–
Testing and Reconstruction via Decision Trees
Li-Yang Tan (Stanford University)
–
Break
–
Recent Developments in Supervised Learning With Noise
Ilias Diakonikolas (UW Madison)