Lecture

Rademacher Complexity Control: Empirical Risk

In course

Aliquip incididunt qui eu dolore eiusmod aute labore occaecat est amet ullamco irure Lorem. Adipisicing proident occaecat excepteur occaecat fugiat nostrud non fugiat esse ut qui cillum pariatur. Consequat veniam dolore est quis cupidatat nisi amet.

Description

This lecture introduces the goals of statistical learning theory, presents an upper bound on the expected estimation error, defines Rademacher complexity, and discusses a lemma on empirical process control with Rademacher complexity. It also explores how to bound the expected estimation error using Rademacher complexity.

Official source

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

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.

Ontological neighbourhood

Statistics

Statistical inference: Mathematical statistics

Related lectures (32)

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.