Fetching the paper…
Reading the bibliography…
This paper describes a simple framework for structured sparse recovery based on convex optimization.
On general minimax theorems
Maurice Sion et al · 1958
Earlier work this paper cites.
Total dual integrality and integer polyhedra
FR Giles and William R Pulleyblank · 1979
Earlier work this paper cites.
Alpha-balanced graphs and matrices and GF(3)-representability of matroids
Klaus Truemper · 1982
Earlier work this paper cites.
Exclusive lasso for multi-task feature selection
Y. Zhou, R. Jin, and S. Hoi · 1990
Earlier work this paper cites.
Integer and combinatorial optimization
George L Nemhauser and Laurence A Wolsey · 1999
Earlier work this paper cites.
Spiking neuron models: Single neurons, populations, plasticity
W Gerstner and W. Kistler · 2002
Earlier work this paper cites.
Grouped and hierarchical model selection through composite absolute penalties
Peng Zhao, Guilherme Rocha, and Bin Yu · 2006
Earlier work this paper cites.
Wavelet-domain compressive signal reconstruction using a hidden markov tree model
Marco F Duarte, Michael B Wakin, and Richard G Baraniuk · 2008
Earlier work this paper cites.
Quadratic programming on graphs without long odd cycles
Marcin Kamiński · 2008
Earlier work this paper cites.
Compressive sensing recovery of spike trains using a structured sparsity model
C. Hegde, M. Duarte, and V. Cevher · 2009
Earlier work this paper cites.
Structured sparsity-inducing norms through submodular functions
F. Bach · 2010
Cited alongside, same era.
Model-based compressive sensing
R.G. Baraniuk, V. Cevher, M.F. Duarte, and C. Hegde · 2010
Cited alongside, same era.
Learning with submodular functions: A convex optimization perspective
F. Bach · 2011
Cited alongside, same era.
Learning with structured sparsity
J. Huang, T. Zhang, and D. Metaxas · 2011
Cited alongside, same era.
Structured variable selection with sparsity-inducing norms
R. Jenatton, J.-Y. Audibert, and F. Bach · 2011
Cited alongside, same era.
Proximal methods for hierarchical sparse coding
R. Jenatton, J. Mairal, G. Obozinski, and F. Bach · 2011
Cited alongside, same era.
The convex geometry of linear inverse problems
V. Chandrasekaran, B. Recht, P.A. Parrilo, and A.S. Willsky · 2012
Later among the works it cites.
Combinatorial selection and least absolute shrinkage via the clash algorithm
A. Kyrillidis and V. Cevher · 2012
Later among the works it cites.
Convex relaxation for combinatorial penalties
G. Obozinski and F. Bach · 2012
Later among the works it cites.
Group-sparse model selection: Hardness and relaxations
L. Baldassarre, N. Bhan, V. Cevher, and A. Kyrillidis · 2013
Later among the works it cites.
Tractability of interpretability via selection of group-sparse models
B. Nirav, L. Baldassarre, and V. Cevher · 2013
Later among the works it cites.
A sparse-group lasso
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convex envelopes of complexity controlling penalties: the case against premature envelopment
Vladimir Jojic, Suchi Saria, and Daphne Koller · 2011
Cited alongside, same era.
Group lasso with overlaps: The latent group lasso approach
G. Obozinski, L. Jacob, and J.P. Vert · 2011
Cited alongside, same era.
Efficient adaptive compressive sensing using sparse hierarchical learned dictionaries
Akshay Soni and Jarvis Haupt · 2011
Cited alongside, same era.
Noah Simon, Jerome Friedman, Trevor Hastie, and Robert Tibshirani · 2013
Later among the works it cites.
Provable submodular minimization using wolfe’s algorithm
P. Kothari D. Chakrabarty, P. Jain · 2014
Closest in time.
Is submodularity testable?
C Seshadhri and Jan Vondrák · 2014
Closest in time.
Structured regularizers for high-dimensional problems: Statistical and computational issues
Martin J Wainwright · 2014
Closest in time.