A Unified Framework for Constructing Nonconvex Regularizations

Abstract

Over the past decades, many individual nonconvex methods have been proposed to achieve better sparse recovery performance in various scenarios. However, how to construct a valid nonconvex regularization function remains open in practice. In this paper, we fill in this gap by presenting a unified framework for constructing the nonconvex regularization based on the probability density function. Meanwhile, a new nonconvex sparse recovery method constructed via the Weibull distribution is studied.

References in corpus (6)

• Nearly unbiased variable selection under minimax concave penalty
• A fast approach for overcomplete sparse decomposition based on smoothed L0 norm
• Successive Concave Sparsity Approximation for Compressed Sensing
• A Novel Regularization Based on the Error Function for Sparse Recovery
• Minimization of Transformed $L_1$ Penalty: Theory, Difference of Convex Function Algorithm, and Robust Application in Compressed Sensing
• Robustness of Sparse Recovery via $F$-minimization: A Topological Viewpoint