Neha Sangwan, TIFR
Friday, 18 February 2022, 16:00 to 17:00
- Via Zoom
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.
Zoom link: https://zoom.us/j/93889521556?pwd=eEFJWVRtRHNpNlpZWmhNYTJGQTF6Zz09