BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1221
DTSTAMP:20230914T125955Z
SUMMARY:Best arm Identification in Multi-Armed Bandits
DESCRIPTION:Speaker: Agniv Bandyopadhyay\n\nAbstract: \nPapers by: \n(1)"Be
 st Arm Identification in Multi-Armed Bandits" by Audibert and Bubeck\, 201
 0.\n(2)"Tight (Lower) Bounds for the Fixed Budget Best Arm IdentificationB
 andit Problem" Carpentier and Locatelli 2016.\n\nPaper (1) gives two algor
 ithms for the best arm identification problem in stochastic multi-armed ba
 ndits under a fixed budget: Upper Confidence Bound-Exploration(UCB-E) and 
 Successive Reject(SR). They also prove a lower bound of error probability 
 in the limited budget setting. Paper (2) later improved that lower bound a
 nd proved that it matches the upper bound of the probability of error for 
 the SR-Algorithm\, thus proving its optimality. We'll look at the results 
 established in Paper (1) and look through paper (2) if time permits.\n\nJo
 ining Link: https://us02web.zoom.us/j/9290331190\n
URL:https://www.tcs.tifr.res.in/web/events/1221
DTSTART;TZID=Asia/Kolkata:20220720T150000
DTEND;TZID=Asia/Kolkata:20220720T160000
LOCATION:Via Zoom
END:VEVENT
END:VCALENDAR