Backend
Scaled-Gradient Hard Thresholding Algorithms for Sparse Signal Recovery
arXiv math.IT0 views
arXiv:2610.41302v1 Announce Type: new Abstract: Thresholding methods provide a simple iterative framework for sparse signal recovery by combining a search direction with a thresholding operation. Gradient-based search directions are computationally efficient because they require only first-order information for the error metric. We incorporate componentwise gradient scaling into this framework by preserving large-magnitude components and attenuating the remaining components of the gradient of error metric. Combining this strategy with hard thresholding yields scaled-gradient hard thresholding (SGHT) and its pursuit variant SGHTP. Under suitable restricted isometry conditions, we establish recovery error bounds for both methods that account for measurement noise and deviations from exact sparsity. Numerical experiments indicate that SGHTP achieves recovery performance comparable to established pursuit methods on the tested ECG signals.
Source:https://arxiv.org/abs/2610.41302PreviousPOST-MIMO: Partition-Oriented Semantic Transmission for MIMO Point Cloud DeliveryNextLEO Constellation Analysis for Satellite IoT: An Analysis of Coverage Gaps and Retransmissions
Related posts
Turn Today’s Messy Notes Into Tomorrow’s Checklist With AI
0dev.to AI
A 763B MoE at "2 Bits": Where the Bytes Really Go in the GSQ-RCO GGUFs, and Why 100% Recovery Sits Inside the Noise
0dev.to AI
How I ship fixes to open-source projects maintainers actually merge (with AI in the loop)
0dev.to AI
Prompt Injection Through Documents: How to Harden an LLM Extraction Pipeline
0dev.to AI
Keeping noindex, the sitemap and the image sitemap in agreement for programmatic pages
0dev.to AI
3 Things in AI You Should Know: Character.AI Files for Bankruptcy
0dev.to AI