(Virtual) DIMACS Workshop on Entropy and Optimization on May 18, 19, 2022

Mohit Singh and I are organizing a two-day virtual DIMACS Workshop on Entropy and Optimization that starts tomorrow — May 18, 19, 2022.

We have a stellar lineup of speakers:

Nima Anari (Stanford University), Alexander Barvinok (Michigan), Mark Braverman (Princeton), Sebastien Bubeck (Microsoft Research), Péter Csikvári (Alfred Renyi Institute of Mathematics), Zongchen Chen (MIT), Ronen Eldan (Weizmann), Tali Kaufman (Bar-Ilan University), Jon Lee (Michigan), Shayan Oveis-Gharan (U Washington)

The goal of this workshop is to explore various connections between entropy, optimization, and sampling. Entropy-maximizing probability distributions have been recently used in interesting ways in applications such as algorithms for counting problems, algorithms for NP-hard optimization problems, and interior-point methods for convex programming

Attendance to the workshop is free but registration is required. To see the program of the workshop and register, visit here.

Looking forward to seeing many of you there!


Discover more from Algorithms, Nature, and Society

Subscribe to get the latest posts sent to your email.

Leave a Reply