EnCORE Workshop on Computational vs Statistical Gaps in Learning and Optimization - IPAM

EnCORE Workshop on Computational vs Statistical Gaps in Learning and Optimization

February 26 - March 1, 2024

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, February 26, 2024

Morning Session

08:00-08:55
Check-In/Breakfast (Hosted by IPAM)
08:55-09:00
Welcome and Opening Remarks
SESSION CHAIR: Raghu Meka (UCLA)
09:00-09:50
Ankur Moitra (Massachusetts Institute of Technology)
Learning from Dynamics
10:00-10:15
Break
10:15-11:05
Ravi Kumar (Google Inc.)
learning-Augmented Online Optimization
11:15-11:30
Break
11:30-12:20
Jelani Nelson (University of California, Berkeley (UC Berkeley))
New local differentially private protocols for frequency and mean estimation

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-14:30
SESSION CHAIR: Arya Mazumdar
14:30-15:20
Adel Javanmard (University of Southern California (USC))
Learning from Aggregate Responses
15:30-16:00
Break
16:00-16:50
Omer Reingold (Stanford University)
Learn Now, Optimize Later: Algorithmic Fairness, Loss Minimization and Outcome Indistinguishability
17:00-17:15
Lightning Poster Session
17:15-18:30
Reception (Location: IPAM Lobby)

Tuesday, February 27, 2024

Morning Session

08:00-09:00
Check-In/Breakfast (Hosted by IPAM)
09:00-09:50
Vasilis Kontonis (University of Texas at Austin)
Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
10:00-10:15
Break
10:15-11:05
Pasin Manurangasi (Google Thailand)
The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise
11:15-11:30
Break
11:30-12:20
Abhineet Agarwal (University of California, Berkeley (UC Berkeley))
Understanding and overcoming the statistical limitations of decision trees

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Thien Le (Massachusetts Institute of Technology)
On the hardness of learning under symmetries
15:30-16:00
Break
16:00-16:30
Rachel Ward (University of Texas at Austin)
Title not available

Wednesday, February 28, 2024

Morning Session

08:00-09:00
Check-In/Breakfast (Hosted by IPAM)
09:00-09:00
SESSION CHAIR: Rachel Ward
09:00-09:50
Andrea Montanari (Stanford University)
Solving overparametrized systems of nonlinear equations
10:00-10:15
Break
10:15-11:05
Cynthia Rush (Columbia University)
Is It Easier to Count Communities Than Find Them?
11:15-11:30
Break
11:30-12:20
Matus Telgarsky (Courant Institute of Mathematical Sciences)
A Perceptron Trio

Afternoon Session

12:30-12:30
Group Photo
12:30-14:30
Lunch (on your own)
14:30-15:20
Wasim Huleihel (Tel Aviv University)
Testing Dependency of Databases
15:30-16:00
Break
16:00-16:50
Giang Tran (University of Waterloo)
Fast Multipole Attention: A Divide-and-Conquer Attention Mechanism for Long Sequences

Thursday, February 29, 2024

Morning Session

08:00-09:00
Check-In/Breakfast (Hosted by IPAM)
09:00-09:00
SESSION CHAIR: Matus Telgarsky (Courant Institute, NYU)
09:00-09:50
Jelena Diakonikolas (University of Wisconsin-Madison)
Robust Learning of a Single Neuron: Bridging Computational Gaps Using Insights from Optimization
10:00-10:15
Break
10:15-11:05
Sitan Chen (Harvard University)
Provably learning a multi-head attention layer
11:15-11:30
Break
11:30-12:20
Vatsal Sharan (University of Southern California (USC))
Memory as a lens to understand efficient learning and optimization

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-14:30
SESSION CHAIR: Raghu Meka (UCLA)
14:30-15:20
Arya Mazumdar (University of California, San Diego (UCSD))
Sample complexity of estimation in logistic regression
15:30-16:00
Break
16:00-16:50
TBD
Printable Version