L1-based relaxations for sparsity recovery and graphical model selection in the high-dimensional regime

author: Martin J. Wainwright, UC Berkeley
published: Feb. 25, 2007,   recorded: July 2006,   views: 6245
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

The problem of estimating a sparse signal embedded in noise arises in various contexts, including signal denoising and approximation, as well as graphical model selection. The natural optimization-theoretic formulation of such problems involves "norm" constraints (i.e., penalties on the number of non-zero coefficients), which leads to NP-hard problems in general. A natural approach is to consider the use of the -norm as a computationally tractable surrogate, as has been pursued in both signal processing and statistics.

See Also:

Download slides icon Download slides: mlss06tw_wainwright_brsrg.pdf (593.7 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: