Fast projections onto mixed-norm balls with applications

Details Fast projections onto mixed-norm balls with applications Fast projections onto mixed-norm balls with applications

2012-04-06

arxiv.org/abs/1204.1437v1

Statistics

Machine Learning

Preprint of paper under review

Scientific paper

Joint sparsity offers powerful structural cues for feature selection, especially for variables that are expected to demonstrate a "grouped" behavior. Such behavior is commonly modeled via group-lasso, multitask lasso, and related methods where feature selection is effected via mixed-norms. Several mixed-norm based sparse models have received substantial attention, and for some cases efficient algorithms are also available. Surprisingly, several constrained sparse models seem to be lacking scalable algorithms. We address this deficiency by presenting batch and online (stochastic-gradient) optimization methods, both of which rely on efficient projections onto mixed-norm balls. We illustrate our methods by applying them to the multitask lasso. We conclude by mentioning some open problems.

Affiliated with

Also associated with

No associations

Rating

Fast projections onto mixed-norm balls with applications 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 Fast projections onto mixed-norm balls with applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast projections onto mixed-norm balls with applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183497