Workshops

Fall 2021

Computational Complexity of Statistical Inference Boot Camp

Aug 23, 2021 to Aug 27, 2021

Return to event »

Monday, August 23rd, 2021
9:30 am–9:35 am		Opening Remarks
9:35 am–10:30 am		In Search of New Algorithms Part I: Neural Networks Adam Klivans (University of Texas at Austin)
10:30 am–10:45 am		Break
10:45 am–11:45 am		In Search of New Algorithms Part II: Graphical Models Adam Klivans (University of Texas at Austin)
11:45 am–2:00 pm		Lunch
2:00 pm–3:00 pm		The Fine Line between Hard and Easy Inference Problems: The View from CSPs Boaz Barak (Harvard)
3:00 pm–3:15 pm		Break
3:15 pm–4:15 pm		The Fine Line between Hard and Easy Inference Problems: The View from CSPs (continued) Boaz Barak (Harvard)
4:15 pm–5:15 pm		Reception

Tuesday, August 24th, 2021
9:30 am–10:30 am		Lower Bounds on Statistical Estimation Rates Under Various Constraints Po-Ling Loh (University of Cambridge)
10:30 am–10:45 am		Break
10:45 am–11:45 am		Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued) Po-Ling Loh (University of Cambridge)
11:45 am–2:00 pm		Lunch
2:00 pm–3:00 pm		On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference Prasad Raghavendra (UC Berkeley)
3:00 pm–3:15 pm		Break
3:15 pm–4:15 pm		On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued) Prasad Raghavendra (UC Berkeley)

Wednesday, August 25th, 2021
9:30 am–10:30 am		Lower Bounds on Statistical Estimation Rates Under Various Constraints Po-Ling Loh (University of Cambridge)
10:30 am–10:45 am		Break
10:45 am–11:45 am		Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued) Po-Ling Loh (University of Cambridge)
11:45 am–2:00 pm		Lunch
2:00 pm–3:00 pm		On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference Prasad Raghavendra (UC Berkeley)
3:00 pm–3:15 pm		Break
3:15 pm–4:15 pm		On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued) Prasad Raghavendra (UC Berkeley)

Thursday, August 26th, 2021
9:30 am–10:30 am		Average-Case Complexity Theory Luca Trevisan (Bocconi University)
10:30 am–10:45 am		Break
10:45 am–11:45 am		Average-Case Complexity Theory (continued) Luca Trevisan (Bocconi University)
11:45 am–2:00 pm		Lunch
2:00 pm–3:00 pm		Approximate Message Passing Algorithms Cynthia Rush (Columbia University)
3:00 pm–3:15 pm		Break
3:15 pm–4:15 pm		Approximate Message Passing Algorithms (continued) Cynthia Rush (Columbia University)

Friday, August 27th, 2021
9:30 am–10:30 am		Average-Case Complexity Theory Luca Trevisan (Bocconi University)
10:30 am–10:45 am		Break
10:45 am–11:45 am		Average-Case Complexity Theory (continued) Luca Trevisan (Bocconi University)
11:45 am–2:00 pm		Lunch
2:00 pm–3:00 pm		Optimal Iterative Algorithms for Problems With Random Data Andrea Montanari (Stanford)
3:00 pm–3:15 pm		Break
3:15 pm–4:15 pm		Optimal Iterative Algorithms for Problems With Random Data Andrea Montanari (Stanford)