Computational Complexity of Statistical Inference Boot Camp

Program

Computational Complexity of Statistical Inference

Location

Calvin Lab Auditorium

Date

Monday, Aug. 23 – Friday, Aug. 27, 2021

Back to calendar

9:30 – 9:35 a.m.

Opening Remarks

9:35 – 10:30 a.m.

In Search of New Algorithms Part I: Neural Networks

Adam Klivans (University of Texas at Austin)

10:30 – 10:45 a.m.

Break

10:45 – 11:45 a.m.

In Search of New Algorithms Part II: Graphical Models

Adam Klivans (University of Texas at Austin)

11:45 a.m. – 2 p.m.

Lunch

2 – 3 p.m.

The Fine Line between Hard and Easy Inference Problems: The View from CSPs

Boaz Barak (Harvard)

3 – 3:15 p.m.

Break

3:15 – 4:15 p.m.

The Fine Line between Hard and Easy Inference Problems: The View from CSPs (continued)

Boaz Barak (Harvard)

4:15 – 5:15 p.m.

Reception

9:30 – 10:30 a.m.

Lower Bounds on Statistical Estimation Rates Under Various Constraints

Po-Ling Loh (University of Cambridge)

10:30 – 10:45 a.m.

Break

10:45 – 11:45 a.m.

Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)

Po-Ling Loh (University of Cambridge)

11:45 a.m. – 2 p.m.

Lunch

2 – 3 p.m.

On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference

Prasad Raghavendra (UC Berkeley)

3 – 3:15 p.m.

Break

3:15 – 4:15 p.m.

On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)

Prasad Raghavendra (UC Berkeley)

9:30 – 10:30 a.m.

Lower Bounds on Statistical Estimation Rates Under Various Constraints

Po-Ling Loh (University of Cambridge)

10:30 – 10:45 a.m.

Break

10:45 – 11:45 a.m.

Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)

Po-Ling Loh (University of Cambridge)

11:45 a.m. – 2 p.m.

Lunch

2 – 3 p.m.

On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference

Prasad Raghavendra (UC Berkeley)

3 – 3:15 p.m.

Break

3:15 – 4:15 p.m.

On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)

Prasad Raghavendra (UC Berkeley)

9:30 – 10:30 a.m.

Average-Case Complexity Theory

Luca Trevisan (Bocconi University)

10:30 – 10:45 a.m.

Break

10:45 – 11:45 a.m.

Average-Case Complexity Theory (continued)

Luca Trevisan (Bocconi University)

11:45 a.m. – 2 p.m.

Lunch

2 – 3 p.m.

Approximate Message Passing Algorithms

Cynthia Rush (Columbia University)

3 – 3:15 p.m.

Break

3:15 – 4:15 p.m.

Approximate Message Passing Algorithms (continued)

Cynthia Rush (Columbia University)

9:30 – 10:30 a.m.

Average-Case Complexity Theory

Luca Trevisan (Bocconi University)

10:30 – 10:45 a.m.

Break

10:45 – 11:45 a.m.

Average-Case Complexity Theory (continued)

Luca Trevisan (Bocconi University)

11:45 a.m. – 2 p.m.

Lunch

2 – 3 p.m.

Optimal Iterative Algorithms for Problems With Random Data

Andrea Montanari (Stanford)

3 – 3:15 p.m.

Break

3:15 – 4:15 p.m.

Optimal Iterative Algorithms for Problems With Random Data

Andrea Montanari (Stanford)