2014
DOI: 10.48550/arxiv.1411.1990
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A totally unimodular view of structured sparsity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…the ℓ 1 -norm for sparse signals, the nuclear-norm for low-rank ones, etc. Please refer for example to [CRPW12], [Bac10], [HC14], [ALMT13] for further discussions.…”
Section: Introductionmentioning
confidence: 99%
“…the ℓ 1 -norm for sparse signals, the nuclear-norm for low-rank ones, etc. Please refer for example to [CRPW12], [Bac10], [HC14], [ALMT13] for further discussions.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we investigate the statistical properties of the Exclusive Lasso for sparse, within group variable selection in regression problems. Specifically, our novel contributions beyond the existing literature (Zhou et al, 2010;Obozinski and Bach, 2012;Halabi and Cevher, 2014) include: characterizing the Exclusive Lasso solution and relating this solution to the existing statistics literature on penalized regression (Section 2); proving consistency and prediction consistency (Section 3); developing a fast algorithm with convergence guarantees for estimation (Section 4); deriving the degrees of freedom that can be used for model selection (Section 5); and investigating the empirical performance of our method through simulations (Sections 6 and 7).…”
Section: Introductionmentioning
confidence: 95%
“…Even though this problem is known to be NP-hard, a popular approach in the literature uses convex penalties to relax similar combinatorial problems into tractable convex problems. While the Lasso (Tibshirani, 1996) is the most well known of these convex relaxations, there are several frameworks specifically designed to find convex alternatives to complicated structured combinatorial problems (Obozinski and Bach, 2012;Halabi and Cevher, 2014). These frameworks lead to convex penalties like the Group Lasso (Yuan and Lin, 2006), Composite Absolute Penalties (Zhao et al, 2009), and the Exclusive Lasso (Zhou et al, 2010), the subject of this paper.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation