BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1094
DTSTAMP:20230914T125950Z
SUMMARY:A Provably Convergent and Practical Algorithm for Min-max Optimizat
ion with Applications to GANs
DESCRIPTION:Speaker: Sushant Vijayan\n\nAbstract: \nAlgorithms for finding
min-max equilibrium points in a zero sum game often exhibit cyclic behavio
r and non-convergence. The authors define a new solution concept for the z
ero sum gameĀ played through stochastic gradient descent (and similar suc
h methods) and propose an algorithm which converges with very high probabi
lity. The equilibrium point is reached in time polynomial in dimension and
smoothness parameters of the function. Importantly no convexity or concav
ity in either players control is assumed and the convergence is independen
t of the initialization point.\n\nZoom link:https://zoom.us/j/98132227553?
pwd=K2cyQllKVjExdUhlRm0vc0ZHcEt0Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1094
DTSTART;TZID=Asia/Kolkata:20201023T171500
DTEND;TZID=Asia/Kolkata:20201023T181500
END:VEVENT
END:VCALENDAR