BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1470
DTSTAMP:20240828T041544Z
SUMMARY:An introduction to fairness in reinforcement learning.
DESCRIPTION:Speaker: Vishakha Patil (Indian Institute of Science\, Bangalor
 e)\n\nAbstract: \nIn a series of three talks\, we present an overview of w
 ork in bandit optimization\, including stochastic and adversarial bandits\
 , and will focus on variants of multi-armed bandits where fairness is an a
 dditional constraint. In Fair-MAB\, for example\, in addition to the objec
 tive of maximizing the sum of expected rewards\, the algorithm also needs 
 to ensure that at any time\, each arm is pulled at least a pre-specified f
 raction of times. We investigate the interplay between learning and fairne
 ss in such settings\, and also investigate the cost of fairness.Talk 1: Th
 ursday 29/8\, 2 - 3:30 pm in A-238Talk 2: Friday 30/8\, 4 - 5:30 pm in A-2
 01Talk 3: Monday 2/9\, 2 - 3:30 pm in A-238\nShort Bio:\nVishakha Patil wo
 rks in online learning and optimization\, game theory\, and mechanism desi
 gn. She completed her PhD from IISc\, supported by a Google Fellowship and
  a CII-SERB PMRF. She has also been a Heidelberg Laureate Forum Young Rese
 archer\, and her MTech thesis received an Honourable Mention for the Best 
 Thesis Award at CSA\, IISc.\n
URL:https://www.tcs.tifr.res.in/web/events/1470
DTSTART;TZID=Asia/Kolkata:20240829T140000
DTEND;TZID=Asia/Kolkata:20240829T150000
LOCATION:A-238
END:VEVENT
END:VCALENDAR