14 search results - page 2 / 3 » Fast Overlapping Group Lasso |
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
CORR
2012
Springer
12 years 19 days ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
BMCBI
2008
13 years 5 months ago
2008
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
With the recent efforts made by computer vision researchers,
more and more types of features have been designed
to describe various aspects of visual characteristics.
Modeling s...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...