Answers are grounded in this paper and cite their sources.
We consider the linear regression model with Gaussian error. We estimate the unknown parameters by a procedure inspired by the Group Lasso estimator introduced in [22]. We show that this estimator satisfies a sparsity inequality, i.e., a bound in terms of the number of non-zero components of the oracle regression vector. We prove that this bound is better, in some cases, than the one achieved by the Lasso and the Dantzig selector.
No takes yet. Share an insight, caveat, or question.
Chesneau et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: