The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms

@article{Bunea2014TheGS,
  title={The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms},
  author={F. Bunea and Johannes Lederer and Y. She},
  journal={IEEE Transactions on Information Theory},
  year={2014},
  volume={60},
  pages={1313-1325}
}
We introduce and study the group square-root lasso (GSRL) method for estimation in high dimensional sparse regression models with group structure. The new estimator minimizes the square root of the residual sum of squares plus a penalty term proportional to the sum of the Euclidean norms of groups of the regression parameter vector. The net advantage of the method over the existing group lasso-type procedures consists in the form of the proportionality factor used in the penalty term, which for… Expand
65 Citations
Scaled and square-root elastic net
  • Elias Raninen, E. Ollila
  • Computer Science, Mathematics
  • 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2017
Sharp Oracle Inequalities for Square Root Regularization
Group-sparse regression using the covariance fitting criterion
Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
PIVOTAL ESTIMATION OF NONPARAMETRIC FUNCTIONS VIA SQUARE-ROOT LASSO
Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming
Sparse regression with exact clustering
Scaled sparse linear regression
Consistent group selection in high-dimensional linear regression.
  • Fengrong Wei, J. Huang
  • Mathematics, Medicine
  • Bernoulli : official journal of the Bernoulli Society for Mathematical Statistics and Probability
  • 2010
...
1
2
3
4
5
...