Sparse Signal Recovery using Log-Sum Regularization and Adaptive Smoothing
Keisuke Morita, Masayuki Ohzeki

TL;DR
This paper introduces a nonconvex log-sum regularization method with adaptive smoothing for sparse signal recovery, using AMP and ADMM algorithms, and analyzes their performance through state evolution predictions.
Contribution
It develops an adaptive smoothing strategy for log-sum regularization, formulates AMP and ADMM algorithms, and compares their empirical performance with theoretical predictions.
Findings
AMP closely follows SE predictions in noisy settings.
ADMM success boundary aligns with SE phase transition in noiseless case.
Log-sum regularization outperforms l1 in low-density and high-measurement regimes.
Abstract
We study sparse signal recovery from noisy linear observations using nonconvex log-sum regularization. The log-sum penalty reduces the shrinkage bias of regularization and more closely approximates the regularization, but its nonconvexity can make reconstruction algorithms unstable. To mitigate this instability, we use an adaptive smoothing strategy that determines the smoothing parameter so that the scalar proximal operator remains continuous. Using this proximal operator, we formulate the approximate message passing (AMP) algorithm and derive the corresponding state evolution (SE) recursion. The fixed point of the SE recursion predicts the final mean squared error (MSE) and, in the noiseless limit, the exact-recovery phase transition. To further investigate finite-dimensional reconstruction behavior, we implement an alternating direction method of multipliers (ADMM)…
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.
