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.
In the scope of this problem set, we are hosting an online-workshop from
August 31st- September 4th via Zoom.
All information incl. the speaker list can be found here:
https://www.uni-frankfurt.de/84973818/Inference_problems__algorithms_and_lower_bounds
Participation is free of charge. If you are interested to participate,
please register via email at fellingh@math.uni-frankfurt.de
Stay safe and all the best
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth and Philipp Loick
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
