Superfast Spectral Compressed Sensing with Quadratic Convergence

DOI10.48550/ARXIV.2610.21068MaRDI QIDQ7395211arXivFDO

Authors Xunmeng Wu, Jian-Feng Cai, Zongben Xu, Zai Yang

Publication date 15 October 2026

Published in arXiv

Tldr We propose Superfast Iterative Hard Thresholding (SIHT), a nonconvex algorithm with provable quadratic convergence for spectral compressed sensing; it achieves exact recovery in the noiseless case and stable recovery in the noisy case with near-optimal sample complexity using state-of-the-art computational and memory efficiency.

Full work available at URL https://doi.org/10.48550/ARXIV.2610.21068

arXiv classification

cs.ITeess.SPmath.NA

This page was built for publication: Superfast Spectral Compressed Sensing with Quadratic Convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395211)