A Lipschitz-Calibrated Functional Optimization Framework with Adaptive Thresholding and Subspace Projection for Sparse Signal Recovery
Year: 2026
Type: preprint
Abstract: Sparse signal recovery is a fundamental problem in compressed sensing, inverse problems, and high-dimensional optimization. Classical iterative thresholding algorithms promote sparsity through convex ℓ₁ regularization but systematically introduce shrinkage bias in nonzero signal coefficients. This paper investigates the Magdoleen Exact Subspace Functional Model (MESFM), a two-stage computational framework combining Lipschitz-calibrated gradient iterations, magnitude-dependent adaptive thresholding, and support-restricted least-squares refinement. Across a comprehensive multi-trial benchmark of 1,800 synthetic compressed sensing problems (m = 40, n = 100, s = 5; 100 random seeds across three noise regimes), MESFM reduces mean relative reconstruction error from 44.68% (standard ISTA/FISTA) and 12.88% (debiased ISTA+LS/FISTA+LS) to 10.50% (median 2.22%) under moderate Gaussian noise (σ = 0.05), while improving exact support recovery from 71% to 83% (p = 0.0075, exact McNemar test). Furthermore, we establish conditional estimation bounds, characterize the trade-off between coefficient accuracy and support identification on an independent 100-seed validation set, and analyze the sensitivity of correlation-scaled thresholding to destructive column interference.
Author: Mudawi, Magdoleen
Institution: Sudan International University
Language: English
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236749667
Cites:
Cited by:
Related to:
