Risk estimation for matrix recovery with spectral regularization
arXiv:1205.1482
Abstract
In this paper, we develop an approach to recursively estimate the quadratic risk for matrix recovery problems regularized with spectral functions. Toward this end, in the spirit of the SURE theory, a key step is to compute the (weak) derivative and divergence of a solution with respect to the observations. As such a solution is not available in closed form, but rather through a proximal splitting algorithm, we propose to recursively compute the divergence from the sequence of iterates. A second challenge that we unlocked is the computation of the (weak) derivative of the proximity operator of a spectral function. To show the potential applicability of our approach, we exemplify it on a matrix completion problem to objectively and automatically select the regularization parameter.
This version is an update of our original paper presented at ICML'2012 workshop on Sparsity, Dictionaries and Projections in Machine Learning and Signal Processing
References in corpus (1)
Cited by in corpus (4)
- 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
- Generalized SURE for optimal shrinkage of singular values in low-rank matrix denoising
- The Degrees of Freedom of Partly Smooth Regularizers