Fano's method for lower bounds in machine learning
STCS Student Seminar
Speaker:
Neha Sangwan
Organiser:
Sushant Vijayan
Date:
Friday, 18 Feb 2022, 16:00 to 17:00
Venue:
Via Zoom
(Scan to add to calendar)
Abstract:
We will see how Fano's inequality, a classical result from information theory, can be used to get tight lower bounds on sample complexity of various learning problems. We will derive Fano's inequality and see its application on an example problem.