BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1414
DTSTAMP:20240418T101926Z
SUMMARY:Online Convex Optimization with Switching Cost and Delayed Gradient
s
DESCRIPTION:Speaker: Pranab Panda (TIFR)\n\nAbstract: \nThis paper focuses
on Online Convex Optimization (OCO) problem with linear and quadratic swit
ching costs and by the help of an online algorithm OMGD(Online Multiple Gr
adient Descent) for a class of L smooth and μ strongly convex functions\,
in limited information setting (where at time t we choose x_t without kno
wing f_t and our objective is to minimise f(x) + S(x_t-1\, x_t) summed ove
r t. S(.\,.) is the switching cost)\, we can achieve a competitive ratio o
f at most 4(L + 5) + 16(L + 5)/μ for quadratic switching cost.Online conv
ex optimization captures many crucial real world problems like server mana
gement in data centres\, etc. We will also try to look at how the performa
nce of online algorithms changes even when the switching cost changes from
quadratic to linear.\nPaper: https://arxiv.org/abs/2310.11880\n
URL:https://www.tcs.tifr.res.in/web/events/1414
DTSTART;TZID=Asia/Kolkata:20240419T160000
DTEND;TZID=Asia/Kolkata:20240419T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR