Convex Sparse Methods for Feature Hierarchies

author: Francis R. Bach, INRIA - SIERRA project-team
published: Aug. 26, 2009,   recorded: June 2009,   views: 4450


Related Open Educational Resources

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.


Sparse methods usually deal with the selection of a few elements from a large collection of pre-computed features. While theoretical results suggest that techniques based on the L1-norm can deal with exponentially many irrelevant features, current algorithms cannot handle more than millions of variables. In this talk, I will show how structured norms can deal in polynomial time with exponentially many features that are organized in a directed acyclic graph.

See Also:

Download slides icon Download slides: icml09_bach_csmf_01.pdf (576.2┬á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: