Lecture

High probability learning guarantees

In course

Elit qui nisi eu do laboris adipisicing. Sit officia aliqua exercitation laboris sit enim. Ex sint veniam nostrud nulla eiusmod voluptate ea minim culpa eu et est.

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

https://mediaspace.epfl.ch/media/0_3z03uqv8

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.

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.