Lecture

Convex Optimization: Nonlinear Dimensionality Reduction

Description

This lecture covers the application of convex optimization in nonlinear dimensionality reduction, focusing on techniques such as the kernel trick and the spread of data points in high-dimensional spaces. The instructor explains the concept of the unfolding problem and its equivalence to an SDP, providing insights into recovering low-dimensional solutions from the SDP solution. Various examples, including piecewise constant and linear fitting, illustrate the practical implications of convex-cardinality problems in signal processing and regression tasks. The lecture concludes with discussions on exact solutions, -norm heuristics, and the interpretation of convex relaxation in addressing cardinality constraints.

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.