A Lipschitz-Calibrated Functional Optimization Framework with Adaptive Thresholding and Subspace Projection for Sparse Signal Recovery

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.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24368987
Primary Topic
Sparse and Compressive Sensing Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Lipschitz-Calibrated Functional Optimization Framework with Adaptive Thresholding and Subspace Projection for Sparse Signal Recovery

Magdoleen Mudawi
Zenodo (CERN European Organization for Nuclear Research)
Sparse and Compressive Sensing Techniques
preprint

A Lipschitz-Calibrated Functional Optimization Framework with Adaptive Thresholding and Subspace Projection for Sparse Signal Recovery

Magdoleen Mudawi
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Sudan International University (SD)
Sparse and Compressive Sensing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon