Events
Fall 2021

Meet the Fellows Welcome Event: Wednesday Schedule

Wednesday, Sep 8, 2021 10:00 am – 5:30 pm 

Add to Calendar

Location: 

Calvin Lab Auditorium

Return to event »

Wednesday, September 8
Schedule
Thursday, September 9
Schedule

 

Wednesday, September 8, 2021

Session 1 Machine Learning I
10 a.m. – 10:10 a.m.
Synthetic Interventions
Dennis Shen (MIT) | Abstract
10:10 a.m. – 10:20 a.m.
Linear Predictors in Reinforcement Learning: From Exponential Lower Bounds to Polynomial Upper Bounds
Andrea Zanette (UC Berkeley) | Abstract
10:20 a.m. – 10:30 a.m.
Towards Credible and Effective Data-Driven Decision-Making
Angela Zhou (UC Berkeley) | Abstract
10:30 a.m. – 10:40 a.m.
Primal--Dual Optimization and Application to Sampling
Adil Salim (Simons Institute) | Abstract
10:40 a.m. – 10:50 a.m.
Data Efficient Methods for Reinforcement Learning
Xian Carrie Wu (Simons Institute) | Abstract
10:50 a.m. – 11 a.m.
Theoretical Foundations of Data-Driven Algorithm Design
Ellen Vitercik (Carnegie Mellon ) | Abstract
11 a.m. – 11:30 a.m. Break
   
Session 2 Algorithms and Complexity
11:30 a.m. – 11:40 a.m.
Distribution-Free Robustness
Sitan Chen (UC Berkeley) | Abstract
11:40 a.m. – 11:50 a.m.
Pseudorandom Generators and Small-Space Derandomization
William Hoza (Simons Institute) | Abstract
11:50 a.m. – 12 p.m.
Preconditioning and Locality in Algorithm Design
Jason Li (Simons and Berkeley) | Abstract
12 p.m. – 12:10 p.m.
Query, Communication and Discrepancy
Makrand Sinha (Simons and Berkeley) | Abstract
12:10 p.m. – 12:20 p.m.
Dynamic Linear Algebra
Jan van den Brand (Simons and Berkeley) | Abstract
12:20 p.m. – 12:30 p.m.
Let's Sample Perfectly
Siddharth Bhandari (Simons Institute) | Abstract
12:30 p.m. – 12:40 p.m.
A Complexity-Theoretic Perspective on Fairness
Michael P. Kim (UC Berkeley) | Abstract
12:40 p.m. – 2 p.m. Lunch
   
Session 3 Quantum Computing I
2 p.m. – 2:10 p.m.
Quantum Simulation of Relativistic Electronic Structure Hamiltonians
Torin Stetina (Simons Institute) | Abstract
2:10 p.m. – 2:20 p.m.
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
Fermi Ma (Simons and Berkeley) | Abstract
2:20 p.m. – 2:30 p.m.
Quantum Necromancy and the Hardness of Observing Schrodinger's Cat
Yosi Atia (UC Berkeley) | Abstract
2:30 p.m. – 2:40 p.m.
Short Proof of a Spectral Chernoff Bound for Local Hamiltonians
Nilin Abrahamsen (Simons Institute) | Abstract
2:40 p.m. – 3 p.m.
Break
   
Session 4 Computational Complexity of Statistical Inference
3 p.m. – 3:10 p.m.
Fundamental Limits and Optimal Uses of Data in Modern Learning Problems
Yanjun Han (Simons Institute) | Abstract
3:10 p.m. – 3:20 p.m.
Convex Programs, Computational Phase Transitions, and Robust Algorithms
Sam Hopkins (UC Berkeley) | Abstract
3:20 p.m. – 3:30 p.m.
Information Theory and Statistics
Cynthia Rush (Columbia University) | Abstract
3:30 p.m. – 4 p.m.
Break
   
Session 5 Computational Complexity of Statistical Inference
4 p.m. – 4:10 p.m.
Understanding Statistical-to-Computational Gaps via Low-Degree Polynomials
Alex Wein (Simons Institute) | Abstract
4:10 p.m. – 4:20 p.m.
Sharp Threshold for the Planted Matching Problem
Dana Yang (Cornell University) | Abstract
4:20 p.m. – 4:30 p.m.
On the Power of Preconditioning in Sparse Linear Regression
Frederic Koehler (UC Berkeley) | Abstract
4:30 p.m. – 4:40 p.m.
Correlation Adjusted Debiasing (CAD): Debiasing the Lasso with Inaccurate Covariate Model
Michael Celentano (Stanford University) | Abstract
4:40 p.m. – 5:30 p.m. Reception