Fetching the paper…
Reading the bibliography…
We consider a class of learning problems that involve a structured sparsity-inducing norm defined as the sum of $\ell_\infty$-norms over groups of variables.
Maximal flow through a network
L. R. Ford and D. R. Fulkerson · 1956
Earlier work this paper cites.
An O(n) algorithm for quadratic knapsack problems
P. Brucker · 1984
Earlier work this paper cites.
A new approach to the maximum flow problem
A. V. Goldberg and R. E. Tarjan · 1986
Earlier work this paper cites.
A fast parametric maximum flow algorithm and applications
G. Gallo, M. E. Grigoriadis, and R. E. Tarjan · 1989
Earlier work this paper cites.
Linear Network Optimization
D. P. Bertsekas · 1991
Earlier work this paper cites.
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
D. S. Hochbaum and S. P. Hong · 1995
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
R. Tibshirani · 1996
Earlier work this paper cites.
On implementing the push-relabel method for the maximum flow problem
B. V. Cherkassky and A. V. Goldberg · 1997
Earlier work this paper cites.
Least angle regression
B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani · 2004
Earlier work this paper cites.
S. P. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Model selection and estimation in regression with grouped variables
M. Yuan and Y. Lin · 2006
Earlier work this paper cites.
Experimental evaluation of a parametric flow algorithm
M. Babenko and A.V. Goldberg · 2006
Cited alongside, same era.
Convex analysis and nonlinear optimization: Theory and examples
J. M. Borwein and A. S. Lewis · 2006
Cited alongside, same era.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Cited alongside, same era.
The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms
V. Roth and B. Fischer · 2008
Cited alongside, same era.
Exploring large feature spaces with hierarchical multiple kernel learning
F. Bach · 2008
Cited alongside, same era.
Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions
J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra · 2008
Cited alongside, same era.
Learning with structured sparsity
J. Huang, Z. Zhang, and D. Metaxas · 2009
Later among the works it cites.
J. Huang and T. Zhang · 2009
Later among the works it cites.
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu · 2009
Later among the works it cites.
Robust face recognition via sparse representation
J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma · 2009
Later among the works it cites.
Model-based compressive sensing
R. G. Baraniuk, V. Cevher, M. Duarte, and C. Hegde · 2010
Closest in time.
Tree-guided group lasso for multi-task regression with structured sparsity
S. Kim and E. P. Xing · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Simultaneous analysis of Lasso and Dantzig selector
P. Bickel, Y. Ritov, and A. Tsybakov · 2009
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Structured variable selection with sparsity-inducing norms
R. Jenatton, J-Y. Audibert, and F. Bach · 2009
Cited alongside, same era.
Group Lasso with overlap and graph Lasso
L. Jacob, G. Obozinski, and J.-P. Vert · 2009
Cited alongside, same era.
The composite absolute penalties family for grouped and hierarchical variable selection
P. Zhao, G. Rocha, and B. Yu · 2009
Cited alongside, same era.
Closest in time.
Proximal methods for sparse hierarchical dictionary learning
R. Jenatton, J. Mairal, G. Obozinski, and F. Bach · 2010
Closest in time.
Joint covariate selection and joint subspace selection for multiple classification problems
G. Obozinski, B. Taskar, and M. I. Jordan · 2010
Closest in time.
Proximal splitting methods in signal processing
P. L. Combettes and J.-C. Pesquet · 2010
Closest in time.
Collaborative hierarchical sparse modeling
P. Sprechmann, I. Ramirez, G. Sapiro, and Y. C. Eldar · 2010
Closest in time.