Selecting Regularization Parameters for nuclear norm type minimization problems
Kexin Li, Hongwei Li, Raymond H. Chan, You-wei Wen

TL;DR
This paper presents a method to automatically select regularization parameters for nuclear norm minimization problems, improving efficiency and accuracy in low-rank matrix reconstruction from noisy data.
Contribution
The authors derive a closed-form solution for the regularization parameter based on the discrepancy principle, enabling automatic and efficient parameter selection.
Findings
The proposed method achieves comparable or better results than SURE-based approaches.
It reduces computational cost by 11-18 times.
Validated on synthetic and real MRI data.
Abstract
The reconstruction of low-rank matrix from its noisy observation finds its usage in many applications. It can be reformulated into a constrained nuclear norm minimization problem, where the bound of the constraint is explicitly given or can be estimated by the probability distribution of the noise. When the Lagrangian method is applied to find the minimizer, the solution can be obtained by the singular value thresholding operator where the thresholding parameter is related to the Lagrangian multiplier. In this paper, we first show that the Frobenius norm of the discrepancy between the minimizer and the observed matrix is a strictly increasing function of . From that we derive a closed-form solution for in terms of . The result can be used to solve the constrained nuclear-norm-type minimization problem when is given. For the unconstrained…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Numerical methods in inverse problems · Statistical and numerical algorithms
