Smooth optimization using global and local low-rank regularizers
Rodrigo A. Lobos, Javier Salazar Cavazos, Raj Rao Nadakuditi, Jeffrey A. Fessler

TL;DR
This paper introduces a smooth low-rank regularizer using a Huber-type function, enabling efficient gradient-based optimization for local low-rank models in inverse problems like MRI reconstruction.
Contribution
It proposes a novel smooth approximation to the nuclear norm with a theoretical framework ensuring convexity and differentiability, facilitating standard gradient algorithms for local low-rank regularization.
Findings
Enables gradient-based optimization for local low-rank models.
Provides empirical validation in MRI reconstruction.
Offers a new step-size strategy leveraging Huber properties.
Abstract
Many inverse problems and signal processing problems involve low-rank regularizers based on the nuclear norm. Commonly, proximal gradient methods (PGM) are adopted to solve this type of non-smooth problems as they can offer fast and guaranteed convergence. However, PGM methods cannot be simply applied in settings where low-rank models are imposed locally on overlapping patches; therefore, heuristic approaches have been proposed that lack convergence guarantees. In this work we propose to replace the nuclear norm with a smooth approximation in which a Huber-type function is applied to each singular value. By providing a theoretical framework based on singular value function theory, we show that important properties can be established for the proposed regularizer, such as: convexity, differentiability, and Lipschitz continuity of the gradient. Moreover, we provide a closed-form expression…
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
MethodsProbability Guided Maxout
