Adaptive estimation in two-way sparse reduced-rank regression

From MaRDI portal
Publication:4986348

DOI10.5705/SS.202017.0073zbMATH Open1464.62466arXiv1403.1922OpenAlexW2962938902MaRDI QIDQ4986348FDOQ4986348


Authors: Zhuang Ma, Zongming Ma, Tingni Sun Edit this on Wikidata


Publication date: 27 April 2021

Published in: STATISTICA SINICA (Search for Journal in Brave)

Abstract: This paper studies the problem of estimating a large coefficient matrix in a multiple response linear regression model when the coefficient matrix could be both of low rank and sparse in the sense that most nonzero entries concentrate on a few rows and columns. We are especially interested in the high dimensional settings where the number of predictors and/or response variables can be much larger than the number of observations. We propose a new estimation scheme, which achieves competitive numerical performance and at the same time allows fast computation. Moreover, we show that (a slight variant of) the proposed estimator achieves near optimal non-asymptotic minimax rates of estimation under a collection of squared Schatten norm losses simultaneously by providing both the error bounds for the estimator and minimax lower bounds. The effectiveness of the proposed algorithm is also demonstrated on an extit{in vivo} calcium imaging dataset.


Full work available at URL: https://arxiv.org/abs/1403.1922




Recommendations





Cited In (9)





This page was built for publication: Adaptive estimation in two-way sparse reduced-rank regression

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