Atelier sur les statistiques combinatoires

30 avril au 4 mai 2018

Programme

 

Le lundi 30 avril 2018

09:00 - 09:30
Inscription (salle 5345) et café-croissants (salle 6245)


Salle(s) de réunion : 6254

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

 

Le mardi 1 mai 2018

09:00 - 09:30
Café croissants


Salle(s) de réunion : 6254

09:30 - 10:30
Constantinos Daskalakis
(MIT)
10:30 - 11:00
Pause-café
11:00 - 12:00
Nicolas Broutin
(Sorbonne Université)
Limits of inhomogeneous random graphs
Résumé
12:00 - 14:00
Pause-déjeuner
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
Résumé
15:00 - 15:30
Pause-café
15:30 - 16:30
Philippe Rigollet
(MIT)
Learning determinantal point processes
Résumé

 

Le mercredi 2 mai 2018

09:00 - 09:30
Café croissants


Salle(s) de réunion : 6254

09:30 - 10:30
Emmanuel Abbe
(Princeton University)
Broadcasting and synchronizing bits on graphs
Résumé
10:30 - 11:00
Pause-café
11:00 - 12:00
J. Michael Steele
(University of Pennsylvania)
The Bohnenblust–Spitzer algorithm and its applications
Résumé
12:00 - 13:30
Pause-déjeuner
13:30 - 14:30
Yuval Peres
(Microsoft Research)
Minicourse on statistical reconstruction problems: Detecting a missing point in a perturbed lattice
Résumé
14:30 - 15:00
Pause-café
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
Résumé

 

Le jeudi 3 mai 2018

09:00 - 09:30
Café croissants


Salle(s) de réunion : 6254

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

 

Le vendredi 4 mai 2018

09:00 - 09:30
Café croissants


Salle(s) de réunion : 6254

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