Sciweavers

398 search results - page 2 / 80
» An efficient algorithm for a class of fused lasso problems
Sort
View
ICML
2009
IEEE
14 years 5 months ago
Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery
We develop a cyclical blockwise coordinate descent algorithm for the multi-task Lasso that efficiently solves problems with thousands of features and tasks. The main result shows ...
Han Liu, Mark Palatucci, Jian Zhang
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 5 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
ICML
2010
IEEE
13 years 6 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...
NIPS
2008
13 years 6 months ago
An Homotopy Algorithm for the Lasso with Online Observations
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
Pierre Garrigues, Laurent El Ghaoui
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
13 years 11 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan