Consistency of the group Lasso and multiple kernel learning

Details Consistency of the group Lasso and multiple kernel learning Consistency of the group Lasso and multiple kernel learning

2007-07-23

arxiv.org/abs/0707.3390v2

Computer Science

Learning

Scientific paper

We consider the least-square regression problem with regularization by a block 1-norm, i.e., a sum of Euclidean norms over spaces of dimensions larger than one. This problem, referred to as the group Lasso, extends the usual regularization by the 1-norm where all spaces have dimension one, where it is commonly referred to as the Lasso. In this paper, we study the asymptotic model consistency of the group Lasso. We derive necessary and sufficient conditions for the consistency of group Lasso under practical assumptions, such as model misspecification. When the linear predictors and Euclidean norms are replaced by functions and reproducing kernel Hilbert norms, the problem is usually referred to as multiple kernel learning and is commonly used for learning from heterogeneous data sources and for non linear variable selection. Using tools from functional analysis, and in particular covariance operators, we extend the consistency results to this infinite dimensional case and also propose an adaptive scheme to obtain a consistent model estimate, even when the necessary condition required for the non adaptive scheme is not satisfied.

Affiliated with

Also associated with

No associations

Rating

Consistency of the group Lasso and multiple kernel learning 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 Consistency of the group Lasso and multiple kernel learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consistency of the group Lasso and multiple kernel learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109826