Monday 08/31/2020

Time (UTC) Speaker Title/Abstract
a) 1:00-2:00  Emmanuel Abbe Lower-bounds for descent algorithms [details][slides]
b) 2:00-3:00  Pascal Vontobel Characterizing the Bethe partition function of  double-edge factor graphs via graph covers  [details] [slides]
   15 min Break  
c) 3:15-4:15 Afonso Bandeira Hardness of refuting coloring in random graphs and quietcomputational planting [details]
d) 4:15-5:15 Christopher Brzuska Relations between random constraint satisfaction problems and cryptography [details][slides]

Tuesday 09/01/2020

Time (UTC) Speaker Title/Abstract
a) 1:00-2:00 Nader Bshouty  Bounds for Group Testing Algorithms to Determine the Number of Defectives [details] [slides]
b) 2:00-3:00 Matthew Aldridge Inference Problems in the linear regime: Lessons learned from group testing  [details][slides]
   15 min break  
c) 3:15-4:15  Dan Vilenchik  A Greedy Anytime Algorithm for Sparse PCA [details][slides]
d) 4:15-5:15  Michael Gastpar  Generalization Error Bounds Via Renyi-, f-Divergences and Maximal Leakage [details]

Wednesday 09/02/2020

Time (UTC) Speaker Title/Abstract
a)1:00-2:00 Charilaos Efthymiou On sampling symmetric Gibbs distributions on sparse random (hyper)graphs  with contiguity  [details][slides]
b) 2:00-3:00 Andreas Galanis Counting solutions in the random k-SAT model  [details]
   15 min Break  
c) 3:15-4:15 Clement Canonne Interactive Inference under Information Constraints [details][slides]
d) 4:15-5:15 Holger Dell Approximately counting and sampling edges in hypergraphs using an
independence oracle [details]

Thursday 09/03/2020

Time (UTC) Speaker Title/Abstract
a) 1:00-2:00 Zongming Ma Testing equivalence of clustering [details]
b) 2:00-3:00 Arya Mazumdar Learning Mixtures and Trace Reconstruction [details]
  15 min break  
c) 3:15-4:15 Tatjana Pavlenko Detecting of sparse and weak effects in high dimensions [details][slides]
d) 4:15-5:15 Karen Gundersson Turán numbers for hypergraphs and tournaments [details][slides]

Friday 09/04/2020

Time (UTC) Speaker Title/Abstract
a) 1:00-2:00  Ahmed El Alaoui Optimization of mean-field spin glass Hamiltonians [details]
b) 2:00-3:00  Matija Pasch Inference and mutual information on random factor graphs [details][slides]
c) 3:00-4:00  Manuel Saenz Strong replica symmetry for high-dimensional disordered log-concave Gibbs measures [details][slides]