Lecture

Complexity: Approximation-Estimation Trade-off

In course

Magna nulla exercitation quis quis minim consectetur sint commodo non. Aliquip culpa proident enim incididunt labore fugiat dolore eiusmod commodo aliqua culpa ipsum velit ad. Deserunt nostrud labore commodo fugiat proident reprehenderit culpa duis. Ullamco anim laboris laboris excepteur officia irure nostrud. Nisi irure labore pariatur quis ea dolore sint ex ipsum laboris duis mollit cillum. Officia fugiat ex laborum nulla.

Description

This lecture covers the explicit and implicit control of complexity in hypothesis spaces, including variables, polynomial functions, spline functions, wavelet approximations, and RKHS bandwidth. It also discusses risk decomposition, the approximation-estimation trade-off, overfitting, regularization, prediction error, bias-variance tradeoff, and the complexity of models.

Official source

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

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

Data analysis: Cross-validation

Mathematics

Analysis: Numerical analysis

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (36)

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.