Fetching the paper…
Reading the bibliography…
We consider the empirical risk minimization problem for linear supervised learning, with regularization by structured sparsity-inducing norms.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes
R. J. Adler · 1990
Earlier work this paper cites.
Combinatorics: Topics, Techniques, Algorithms
P. J. Cameron · 1994
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Spectral Graph Theory
F. R. K. Chung · 1997
Earlier work this paper cites.
Knowledge Spaces
J. P. Doignon and J. C. Falmagne · 1998
Earlier work this paper cites.
SDPT3–a MATLAB software package for semidefinite programming, version 1.3
K. C. Toh, M. J. Todd, and R. H. Tütüncü · 1999
Earlier work this paper cites.
Asymptotics for Lasso-type estimators
W. Fu and K. Knight · 2000
Earlier work this paper cites.
On the Lasso and its dual
M. R. Osborne, B. Presnell, and B. A. Turlach · 2000
Earlier work this paper cites.
Concentration Inequalities and Model Selection: Ecole d’été de Probabilités de Saint-Flour 23
P. Massart · 2003
Earlier work this paper cites.
Morphological Image Analysis: Principles and Applications
P. Soille · 2003
Earlier work this paper cites.
Solving semidefinite-quadratic-linear programs using SDPT3
R. H. Tütüncü, K. C. Toh, and M. J. Todd · 2003
Earlier work this paper cites.
Convex Optimization
S. P. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Least angle regression
B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani · 2004
Earlier work this paper cites.
Boosting as a regularized path to a maximum margin classifier
S. Rosset, J. Zhu, and T. Hastie · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
Earlier work this paper cites.
Convex Analysis and Nonlinear Optimization: Theory and Examples
J. M. Borwein and A. S. Lewis · 2006
Cited alongside, same era.
Human detection using oriented histograms of flow and appearance
N. Dalal, B. Triggs, and C. Schmid · 2006
Cited alongside, same era.
Learning the kernel function via regularization
C. A. Micchelli and M. Pontil · 2006
Cited alongside, same era.
Model selection and estimation in regression with grouped variables
M. Yuan and Y. Lin · 2006
Cited alongside, same era.
On model selection consistency of Lasso
P. Zhao and B. Yu · 2006
Cited alongside, same era.
The adaptive Lasso and its oracle properties
H. Zou · 2006
Cited alongside, same era.
Combining efficient object localization and image classification
H. Harzallah, F. Jurie, and C. Schmid · 2009
Closest in time.
Exploiting structure in wavelet-based Bayesian compressive sensing
L. He and L. Carin · 2009
Closest in time.
The benefit of group sparsity
J. Huang and T. Zhang · 2009
Closest in time.
Learning with structured sparsity
J. Huang, T. Zhang, and D. Metaxas · 2009
Closest in time.
Group Lasso with overlaps and graph Lasso
L. Jacob, G. Obozinski, and J.-P. Vert · 2009
Closest in time.
Tree-guided group Lasso for multi-task regression with structured sparsity
S. Kim and E. P. Xing · 2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A necessary and sufficient condition for exact recovery by l1 minimization
C. Dossal · 2007
Cited alongside, same era.
Efficient sparse coding algorithms
H. Lee, A. Battle, R. Raina, and A.Y. Ng · 2007
Cited alongside, same era.
Convex multi-task feature learning
A. Argyriou, T. Evgeniou, and M. Pontil · 2008
Cited alongside, same era.
Model-based compressive sensing
R. G. Baraniuk, V. Cevher, M. F. Duarte, and C. Hegde · 2008
Cited alongside, same era.
Stability selection
N. Meinshausen and P. Bühlmann · 2008
Cited alongside, same era.
On the asymptotic properties of the group Lasso estimator for linear models
Y. Nardi and A. Rinaldo · 2008
Cited alongside, same era.
Joint covariate selection and joint subspace selection for multiple classification problems
G. Obozinski, B. Taskar, and M.I. Jordan · 2009
Closest in time.
Approximation accuracy, gradient methods, and error bound for structured convex optimization
P. Tseng · 2009
Closest in time.
Sharp thresholds for noisy and high-dimensional recovery of sparsity using ℓ 1 \ell_{1} - constrained quadratic programming
M. J. Wainwright · 2009
Closest in time.
Boosting with spatial regularization
Z. J. Xiang, Y. T. Xi, U. Hasson, and P. J. Ramadge · 2009
Closest in time.
A comparison of optimization methods for large-scale L1-regularized linear classification
G. X. Yuan, K. W. Chang, C. J. Hsieh, and C. J. Lin · 2009
Closest in time.
Some sharp performance bounds for least squares regression with l1 regularization
T. Zhang · 2009
Closest in time.
The composite absolute penalties family for grouped and hierarchical variable selection
P. Zhao, G. Rocha, and B. Yu · 2009
Closest in time.
Structured sparse principal component analysis
R. Jenatton, G. Obozinski, and F. Bach · 2010
Closest in time.
Online learning for matrix factorization and sparse coding
J. Mairal, F. Bach, J. Ponce, and G. Sapiro · 2010
Closest in time.