Inference problems: algorithms and lower bounds
Topic: Inference problems play a pivotal role in modern computer science, mathematics and statistics.The guiding question in these problems is to determine the minimum number of queries that enable the inference a latent ground truth, either information-theoretically or algorithmically. Prominent recent success stories include the stochastic block model, compressed sensing, group testing and low-density parity check codes. The techniques employed to tackle these problems originate in information theory, statistical physics, probability theory as well as combinatorics.
Objective: The goal of this online workshop is to bring together leading researchers from the various disciplines
involved in order to discuss recent advances, new techniques and future challenges.
The one-week online workshop receives funding from the German Research Foundation
and will be hosted at the Goethe University Frankfurt
The workshop will take place online and participation is free of charge.
Please contact Mrs Fellinghauer via E-mail (fellingh[at]math.uni-frankfurt.de) until 08/26/2020.
Further information about the workshop will be published soon.
|Emmanuel Abbe (EPFL)|
|Matthew Aldridge (University of Leeds)|
|Alfonso Bandeira (ETH Zurich)|
|Jean Barbier (ICTP)|
|Christopher Brzuska (Aalto University)|
|Nader Bshouty (Technion)|
|Clement Canonne (IBM Research)|
|Holger Dell (ITU Copenhagen)|
|Charilaos Efthymiou (University of Warwick)|
|Ahmed El Alaoui (Stanford University)|
|Andreas Galanis (Oxford)|
|Michael Gastpar (EPFL)|
|Karen Gundersson (University of Manitoba)|
|Zongming Ma (University of Pennsylvania)|
|Nicolas Macris (EPFL)|
|Arya Mazumdar (University of Massachusetts)|
|Matija Pasch (LMU Munich)|
|Tatjana Pavlenko (Royal Institute of Technology KTH)|
|Christian Sohler (TU Dortmund)|
|Eric Vigoda (Georgia Tech)|
|Dan Vilenchik (Ben Gurion)|
|Pascal Vontobel (Chinese University of Hong Kong)|