Caltech Logo

TCS+ Talk

Wednesday, September 25, 2019
10:00am to 11:00am
Add to Cal
Annenberg 322
Chasing Convex Bodies
Mark Sellke, Graduate Student, Stanford,

Abstract: I will explain our recent understanding of the chasing convex bodies problem posed by Friedman and Linial in 1991. In this problem, an online player receives a request sequence K_1,...,K_T of convex sets in d dimensional space and moves his position online into each requested set. The player's movement cost is the length of the resulting path. Chasing convex bodies asks if there an online algorithm with cost competitive against the offline optimal path. This is both an challenging metrical task system and (equivalent to) a competitive analysis view on online convex optimization.

This problem was open for d>2 until last year but has recently been solved twice. The first solution gives a 2^{O(d)} competitive algorithm while the second gives a nearly optimal min(d,sqrt(d*log(T))) competitive algorithm for T requests. The latter result is based on the Steiner point, which is the exact optimal solution to a related geometric problem called Lipschitz selection and dates from 1840. In the talk, I will briefly outline the first solution and fully explain the second.

Partially based on joint works with S├ębastien Bubeck, Bo'az Klartag, Yin Tat Lee, and Yuanzhi Li.

For more information, please contact Bonnie Leung by email at [email protected].