Learning with Structured Sparsity
published: Aug. 26, 2009, recorded: June 2009, views: 6100
Report a problem or upload filesIf 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.
This paper investigates a new learning formulation called structured sparsity, which is a natural extension of the standard sparsity concept in statistical learning and compressive sensing. By allowing arbitrary structures on the feature set,this concept generalizes the group sparsity idea. A general theory is developed for learning with structured sparsity, based on the notion of coding complexity associated with the structure. Moreover, a structured greedy algorithm is proposed to efﬁciently solve the structured sparsity problem. Experiments demonstrate the advantage of structured sparsity over standard sparsity.
Download slides: icml09_huang_lwss_01.pdf (701.3 KB)
Download slides: icml09_huang_lwss_01.ppt (753.5 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !