Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
High probability learning guarantees
Description
This lecture covers the application of Talagrand's lemma, bounds on empirical Rademacher complexity for linear and RKHS functions, McDiarmid's inequality, concentration of empirical Rademacher complexity, and high probability bounds on the empirical process deviations and risk.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.