BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1122
DTSTAMP:20230914T125951Z
SUMMARY:Chasing Convex Functions
DESCRIPTION:Speaker: Anupam Gupta (Carnegie Mellon University)\n\nAbstract:
  \nThe problem of chasing convex functions is easy to state: faced with a 
 sequence of convex functions {f_t}\, the goal of the algorithm is to outpu
 t a point x_t at each time\, so that the sum of the function costs f_t(x_t
 )\, plus the movement costs || x_t - x_{t-1} || is minimized. This general
  problem generalizes several classic questions in online algorithms\, such
  as caching and the k-server problem.\nThe question of getting an algorith
 m whose total cost is comparable to the optimal cost in hindsight was pose
 d by Friedman and Linial in 1994. This was finally (mostly) resolved last 
 year\, using a combination of ideas from online algorithms and convex geom
 etry. In this talk we will survey the results and ideas.\nThis is based on
  works with C.J.Argue\, S.Bubeck\, M.B.Cohen\, G.Guruganesh\, Y. T.Lee\, a
 nd Z.Tang.\nYouTube link : https://www.youtube.com/watch?v=TMilw8CX1Yg\n
URL:https://www.tcs.tifr.res.in/web/events/1122
DTSTART;TZID=Asia/Kolkata:20210323T160000
DTEND;TZID=Asia/Kolkata:20210323T170000
END:VEVENT
END:VCALENDAR