3607 search results - page 1 / 722 » Learning with structured sparsity |
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
ICCV
2009
IEEE
13 years 2 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...