Structured Sparsity and Generalization

Details Structured Sparsity and Generalization Structured Sparsity and Generalization

2011-08-17

arxiv.org/abs/1108.3476v2

Computer Science

Learning

Scientific paper

We present a data dependent generalization bound for a large class of regularized algorithms which implement structured sparsity constraints. The bound can be applied to standard squared-norm regularization, the Lasso, the group Lasso, some versions of the group Lasso with overlapping groups, multiple kernel learning and other regularization schemes. In all these cases competitive results are obtained. A novel feature of our bound is that it can be applied in an infinite dimensional setting such as the Lasso in a separable Hilbert space or multiple kernel learning with a countable number of kernels.

Affiliated with

Also associated with

No associations

Rating

Structured Sparsity and Generalization 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 and Generalization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structured Sparsity and Generalization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540531