Algorithmic Advances for Statistical Inference with Combinatorial Structure

Program

Computational Complexity of Statistical Inference

Date

Monday, Oct. 11 – Friday, Oct. 15, 2021

Back to calendar

8:30 – 8:50 a.m.

Coffee & Check-In

8:50 – 9 a.m.

Opening Remarks

9 – 9:45 a.m.

Random Combinatorial Matrices

Amin Coja-Oghlan (Goethe University)

9:45 – 10:15 a.m.

Break

10:15 – 11 a.m.

Correlated Stochastic Block Models: Graph Matching And Community Recovery

Miklos Racz (Princeton University)

11 a.m. – 2 p.m.

Lunch

2 – 2:45 p.m.

Statistical Estimation from Dependent Data

Constantinos Daskalakis (MIT)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Tractability And Overparametrization In Some Simple Models

Andrea Montanari (Stanford University)

4 – 5 p.m.

Reception

9 – 9:45 a.m.

How Close To Optimal Sample Complexity Does Gradient Descent Get In Phase Retrieval?

Lenka Zdeborová (École polytechnique fédérale de Lausanne)

9:45 – 10:15 a.m.

Break

10:15 – 11 a.m.

Causal Matrix Estimation

Devavrat Shah (MIT)

11 a.m. – 2 p.m.

Lunch

2 – 2:45 p.m.

Differential Privacy Meets Robust Statistics

Sewoong Oh (University of Washington, Seattle)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Exact Minimax Estimation for Phase Synchronization

Chao Gao (University of Chicago)

9 – 9:45 a.m.

A Curious Case Of Symmetric Binary Perceptron Model: Algorithms And Barriers

David Gamarnik (MIT)

9:45 – 10:15 a.m.

Break

10:15 – 11 a.m.

Metric Representations: Algorithms and Geometry

Anna Gilbert (Yale University)

11 a.m. – 2 p.m.

Lunch

2 – 2:45 p.m.

Approximate Message Passing Algorithms For Orthogonally Invariant Models

Zhou Fan (Yale University)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Learning Minimax Estimators Via Online Learning

Pradeep Ravikumar (Carnegie Mellon University)

9 – 9:45 a.m.

New Algorithms For The Graph Alignment Problem

Marc Lelarge (Inria)

9:45 – 10:15 a.m.

Break

10:15 – 11 a.m.

Structures Of Local Minima In K-Means And Mixture Models

Yudong Chen (Cornell University)

11 a.m. – 2 p.m.

Lunch

2 – 2:45 p.m.

Tensor Graphical Models For Complex And High Dimensional Data

Shuheng Zhou (UC Riverside)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Uncertainty Quantification In The Bradley-Terry-Luce Model

Anderson Ye Zhang (The Wharton School, University of Pennsylvania)

9 – 9:45 a.m.

Novel Approaches For Network Data Modelling And Analysis

Sofia Olhede (École polytechnique fédérale de Lausanne)

9:45 – 10:15 a.m.

Break

10:15 – 11 a.m.

Deep Generative Models And Unsupervised Methods For Inverse Problems

Alex Dimakis (University of Texas at Austin)

11 a.m. – 2 p.m.

Lunch

2 – 2:45 p.m.

Exact Matching Of Random Graphs With Constant Correlation

Cheng Mao (Georgia Tech)

2:45 – 3:15 p.m.

Break

3:15 – 4 p.m.

Estimation Beyond the IID Setting: Two Vignettes

Gregory Valiant (Stanford University)