Minimization of Transformed $L_1$ Penalty: Closed Form Representation and Iterative Thresholding Algorithms
Shuai Zhang, and Jack Xin

TL;DR
This paper introduces a closed-form fixed point representation and iterative thresholding algorithms for the transformed $L_1$ penalty, demonstrating superior sparse signal recovery performance in compressed sensing.
Contribution
It develops explicit TL1 thresholding functions and iterative algorithms, enhancing sparse recovery methods over existing thresholding techniques.
Findings
TL1 thresholding functions are in closed form for all parameters.
Proposed TL1 iterative thresholding outperforms hard and half thresholding.
Adaptive thresholds improve recovery accuracy in noisy and noiseless scenarios.
Abstract
The transformed penalty (TL1) functions are a one parameter family of bilinear transformations composed with the absolute value function. When acting on vectors, the TL1 penalty interpolates and similar to norm (). In our companion paper, we showed that TL1 is a robust sparsity promoting penalty in compressed sensing (CS) problems for a broad range of incoherent and coherent sensing matrices. Here we develop an explicit fixed point representation for the TL1 regularized minimization problem. The TL1 thresholding functions are in closed form for all parameter values. In contrast, the thresholding functions () are in closed form only for , known as hard, soft, half, and 2/3 thresholding respectively. The TL1 threshold values differ in subcritical (supercritical) parameter regime where the TL1 threshold functions are…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Electrical and Bioimpedance Tomography · Microwave Imaging and Scattering Analysis
