Adaptive Shrinkage of singular values

Abstract

To recover a low rank structure from a noisy matrix, truncated singular value decomposition has been extensively used and studied. Recent studies suggested that the signal can be better estimated by shrinking the singular values. We pursue this line of research and propose a new estimator offering a continuum of thresholding and shrinking functions. To avoid an unstable and costly cross-validation search, we propose new rules to select two thresholding and shrinking parameters from the data. In particular we propose a generalized Stein unbiased risk estimation criterion that does not require knowledge of the variance of the noise and that is computationally fast. A Monte Carlo simulation reveals that our estimator outperforms the tested methods in terms of mean squared error on both low-rank and general signal matrices across different signal to noise ratio regimes. In addition, it accurately estimates the rank of the signal when it is detectable.

References in corpus (8)

• Matrix estimation by Universal Singular Value Thresholding
• Nonlinear shrinkage estimation of large-dimensional covariance matrices
• Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
• OptShrink: An algorithm for improved low-rank signal matrix denoising by optimal, data-driven singular value shrinkage
• Minimax risk of matrix denoising by singular value thresholding
• Weighted algorithms for compressed sensing and matrix completion
• Equivariant and scale-free Tucker decomposition models
• Blockwise and coordinatewise thresholding to combine tests of different natures in modern ANOVA

Cited by in corpus (1)

• Equivariant and scale-free Tucker decomposition models