BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1188
DTSTAMP:20230914T125954Z
SUMMARY:Fano's method for lower bounds in machine learning
DESCRIPTION:Speaker: Neha Sangwan\n\nAbstract: \nWe will see how Fano's ine
 quality\, a classical result from information theory\, can be used to get 
 tight lower bounds on sample complexity of various learning problems. We w
 ill derive Fano's inequality and see its application on an example problem
 .\n\nZoom link: https://zoom.us/j/93889521556?pwd=eEFJWVRtRHNpNlpZWmhNYTJG
 QTF6Zz09\n
URL:https://www.tcs.tifr.res.in/web/events/1188
DTSTART;TZID=Asia/Kolkata:20220218T160000
DTEND;TZID=Asia/Kolkata:20220218T170000
LOCATION:Via Zoom
END:VEVENT
END:VCALENDAR