Structured sparsity through convex optimization

Details Structured sparsity through convex optimization Structured sparsity through convex optimization

2011-09-12

arxiv.org/abs/1109.2397v2

Computer Science

Learning

Statistical Science (2012) To appear

Scientific paper

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the regularization by the $\ell_1$-norm. In this paper, we consider situations where we are not only interested in sparsity, but where some structural prior knowledge is available as well. We show that the $\ell_1$-norm can then be extended to structured norms built on either disjoint or overlapping groups of variables, leading to a flexible framework that can deal with various structures. We present applications to unsupervised learning, for structured sparse principal component analysis and hierarchical dictionary learning, and to supervised learning in the context of non-linear variable selection.

Affiliated with

Also associated with

No associations

Rating

Structured sparsity through convex optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Structured sparsity through convex optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structured sparsity through convex optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59621