Asymptotic properties of adaptive group Lasso for sparse reduced rank regression

DOI10.1002/STA4.123arXiv1609.06806MaRDI QIDQ6503246FDOQ6503246

Authors: Kejun He, Jianhua Z. Huang 

Abstract: This paper studies the asymptotic properties of the penalized least squares estimator using an adaptive group Lasso penalty for the reduced rank regression. The group Lasso penalty is defined in the way that the regression coefficients corresponding to each predictor are treated as one group. It is shown that under certain regularity conditions, the estimator can achieve the minimax optimal rate of convergence. Moreover, the variable selection consistency can also be achieved, that is, the relevant predictors can be identified with probability approaching one. In the asymptotic theory, the number of response variables, the number of predictors, and the rank number are allowed to grow to infinity with the sample size.

This page was built for publication: Asymptotic properties of adaptive group Lasso for sparse reduced rank regression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6503246)