Rank penalized estimators for high-dimensional matrices
From MaRDI portal
Publication:1952222
DOI10.1214/11-EJS637zbMath1274.62489arXiv1104.1244MaRDI QIDQ1952222
Publication date: 28 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1244
Estimation in multivariate analysis (62H12) Gaussian processes (60G15) Linear inference, regression (62J99) Random matrices (probabilistic aspects) (60B20)
Related Items (16)
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction ⋮ Optimal large-scale quantum state tomography with Pauli measurements ⋮ Matrix completion via max-norm constrained optimization ⋮ A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ Matrix completion by singular value thresholding: sharp bounds ⋮ High-dimensional covariance matrix estimation with missing observations ⋮ Adaptive multinomial matrix completion ⋮ Non-asymptotic approach to varying coefficient model ⋮ Asymptotic equivalence of quantum state tomography and noisy matrix completion ⋮ Noisy low-rank matrix completion with general sampling distribution ⋮ Pivotal estimation via square-root lasso in nonparametric regression ⋮ High-dimensional regression with unknown variance ⋮ Double fused Lasso regularized regression with both matrix and vector valued predictors ⋮ Optimal graphon estimation in cut distance ⋮ Spectral thresholding for the estimation of Markov chain transition operators ⋮ Structured matrix estimation and completion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of high-dimensional low-rank matrices
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Optimal selection of reduced rank estimators of high-dimensional matrices
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Multivariate reduced-rank regression
- Low rank multivariate regression
- Exact matrix completion via convex optimization
- Sharp Oracle Inequalities for High-Dimensional Matrix Prediction
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A Simpler Approach to Matrix Completion
This page was built for publication: Rank penalized estimators for high-dimensional matrices