This lecture covers Carathéodory's Theorem, which provides a bound on the dimension necessary for a set to be represented. The instructor explains the theorem's implications and proofs, emphasizing the concept of minimal counterexamples.
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.
The course aims to introduce the basic concepts and results on metric embeddings, or more precisely on approximate embeddings. This area has been under rapid development since the 90's and it has stro
