Workshop on Combinatorial Statistics

April 30 - May 4, 2018

Program

 

Monday, April 30, 2018

09:00 - 09:30
Registration (Room 5345) and Coffee & Croissants (Room 6245)


Meeting room(s) : 6254

09:30 - 10:30
Laurent Massoulié
(École Polytechnique)
Rapid mixing of local graph dynamics
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Rachel A. Ward
(University of Texas)
Learning the learning rate in stochastic gradient descent
Abstract
12:00 - 14:00
Lunch break
14:00 - 15:00
Yuval Peres
(Microsoft Research)
Minicourse on statistical reconstruction problems: Reconstruction on trees and unpredictable paths
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Andrea Montanari
(Stanford University)
A mean field view of the landscape of two-layers neural networks
Abstract

 

Tuesday, May 1, 2018

09:00 - 09:30
Coffee & Croissants


Meeting room(s) : 6254

09:30 - 10:30
Constantinos Daskalakis
(MIT)
10:30 - 11:00
Coffee break
11:00 - 12:00
Nicolas Broutin
(Sorbonne Université)
Limits of inhomogeneous random graphs
Abstract
12:00 - 14:00
Lunch break
14:00 - 15:00
Yuval Peres
(Microsoft Research)
Minicourse on statistical reconstruction problems: Detecting the trail of a random walk, and a hidden clique in a random graph
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Philippe Rigollet
(MIT)
Learning determinantal point processes
Abstract

 

Wednesday, May 2, 2018

09:00 - 09:30
Coffee & Croissants


Meeting room(s) : 6254

09:30 - 10:30
Emmanuel Abbe
(Princeton University)
Broadcasting and synchronizing bits on graphs
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
J. Michael Steele
(University of Pennsylvania)
The Bohnenblust–Spitzer algorithm and its applications
Abstract
12:00 - 13:30
Lunch break
13:30 - 14:30
Yuval Peres
(Microsoft Research)
Minicourse on statistical reconstruction problems: Detecting a missing point in a perturbed lattice
Abstract
14:30 - 15:00
Coffee break
15:00 - 16:00
Nike Sun
(University of California, Berkeley)
16:30 - 17:30
Alex Wein
(Massachusetts Institute of Technology)
Estimation in the presence of group actions
Abstract

 

Thursday, May 3, 2018

09:00 - 09:30
Coffee & Croissants


Meeting room(s) : 6254

09:30 - 10:30
Roberto Imbuzeiro Oliveira
(IMPA)
Estimating graph parameters via multiple random walks
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Yihong Wu
(Yale University)
Recovering a hidden hamiltonian cycle via linear programming
Abstract
12:00 - 13:30
Lunch break
13:30 - 14:30
Yuval Peres
(Microsoft Research)
Minicourse on statistical reconstruction problems: Trace reconstruction for the deletion channel
Abstract
14:30 - 15:00
Coffee break
15:00 - 16:00
David Gamarnik
(MIT)
Algorithms and algorithmic obstacles in high-dimensional regression
Abstract
16:30 - 17:30
Miklós Z. Rácz
(Princeton University)
High-dimensional random geometric graphs
Abstract

 

Friday, May 4, 2018

09:00 - 09:30
Coffee & Croissants


Meeting room(s) : 6254

09:30 - 10:30
Po-Ling Loh
(University of Wisconsin-Madison)
Two inference problems for network contagion
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Risi Kondor
(The University of Chicago)
12:00 - 14:00
Lunch break
14:00 - 15:00
Jian Ding
(The Wharton School, University of Pennsylvania)
Cycles and paths with minimum average weight
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Quentin Berthet
(University of Cambridge)
Exact recovery in the Ising blockmodel
Abstract