It’s that time of the year again, where you can see TheoryFest decorations in every home, and TheoryFest music is playing in shops and on the radio. For those making the pilgrimage to Los Angeles, I hope to see you there.
There are many great papers, workshops, and other content in the program, but I am particularly looking forward to the Invited Short Plenary talks (and not just because I was involved in their selection..). I think this is a very unique program not just in theory, but among all CS conferences, where the audience gets a chance to see a collection of fantastic works that appeared in a variety of venues. What other event brings together a talk about routing algorithms in data centers and category theory? Or a talk about mechanism design for school choice and the local minima landscape for machine learning?
The talks this year will be the following (in order of presentations – the sessions will be Monday-Thursday at 4 or 4:10pm, the STOC best papers and Lydia Kavraki’s Athena lecture will also be given in these sessions):
- Sanjoy Dasgupta: A Neural Algorithm for Similarity Search (Science)
- Monia Ghobadi: Programming the Topology of Networks: Technology and Algorithms (SIGCOMM 2016)
- Irene Lo: Dynamic Matching in School Choice:Efficient Seat Reassignment after Late Cancellations (MATCH-UP 2017)
- Vyes Sekar: Rethinking Network Flow Monitoring with UnivMon (SIGCOMM 2016)
- Rong Ge: Optimization Landscape for Matrix Completion (NIPS 2016 and ICML 2017)
- Sergey Bravyi: Quantum Advantage with Shallow Circuits (QIP 2018)
- Sam Staton: Higher-Order Probability Theory (LICS 2017)
- Tengyu Ma: Generalization and Equilibrium in Generative Adversarial Nets (GANs) (ICML 2017)
- Dan Suciu: Optimal Query Processing meets Information Theory (PODS 2016)