Mathematical Challenges in Graphical Models and Message-Passing Algorithms

January 23 - 27, 2012

Schedule


Monday, January 23, 2012

9:00 - 9:50
Amir Globerson (Hebrew University)

What Cannot be Learned with Bethe Approximations

10:30 - 11:20
Tamir Hazan (Toyota Technological Institute at Chicago)

 

1:30 - 2:20
Dimitris Achlioptas (COMPUTER TECHNOLOGY INSTITUTE & PRESS “DIOPHANTUS” (CTI))

 

3:00 - 3:50
Cristopher Moore (University of New Mexico)

Message-passing algorithms for network analysis


Tuesday, January 24, 2012

9:00 - 9:50
10:30 - 11:20
Lenka Zdeborova (Commissariat à l'Énergie Atomique (CEA))

Phase transitions and algorithmic barriers in inference problems

1:30 - 2:20
Mohsen Bayati (Stanford University)

 

3:00 - 3:50
Sewoong Oh (Massachusetts Institute of Technology)

Message-passing algorithms for approximate singular vector computation


Wednesday, January 25, 2012

9:00 - 9:50
Tom Richardson (Qualcomm)

 

10:30 - 11:20
Yi Lu (University of Illinois at Urbana-Champaign)

 

1:30 - 2:20
Alex Dimakis (University of Southern California (USC))

 

3:00 - 3:50
Kavita Ramanan (Brown University)

Avatars of the Hard Core Model and their Applications


Thursday, January 26, 2012

9:00 - 9:50
Sebastien Roch (University of California, Los Angeles (UCLA))

Relating Combinatorial and Variational Distances Between Trees

10:30 - 11:20
1:30 - 2:20
Francesco Guerra (Università di Roma “La Sapienza”)

Spontaneous replica symmetry breaking in mean field spin glasses and neural networks

3:00 - 3:50
Shannon Starr (University of Rochester)

Bounds for the antiferromagnetic Erdos-Renyi Potts model

4:15 - 4:40
Sidhant Misra (Massachusetts Institute of Technology)

 

4:40 - 5:05
Linji Yang (Georgia Institute of Technology)

 


Friday, January 27, 2012

9:00 - 9:50
10:30 - 11:20
Amir Dembo (Stanford University)

Factor models on locally tree-like graphs

1:30 - 2:20
Allan Sly (University of California, Berkeley (UC Berkeley))

The complexity of counting for anti-ferromagnetic 2-spin systems