Reliable recovery of hierarchically sparse signals for Gaussian and Kronecker product measurements
Ingo Roth, Martin Kliesch, Axel Flinth, Gerhard Wunder, Jens Eisert

TL;DR
This paper introduces HiHTP, a new algorithm for reliably recovering hierarchically sparse signals from Gaussian and Kronecker product measurements, with improved theoretical guarantees and practical performance.
Contribution
The paper presents HiHTP, a novel variant of Hard Thresholding Pursuit, with proven convergence and enhanced sampling complexity bounds for hierarchically sparse signal recovery.
Findings
HiHTP outperforms HTP in numerical experiments.
Recovery guarantees are improved for noisy Gaussian measurements.
Efficient reconstruction from Kronecker product measurements is demonstrated.
Abstract
We propose and analyze a solution to the problem of recovering a block sparse signal with sparse blocks from linear measurements. Such problems naturally emerge inter alia in the context of mobile communication, in order to meet the scalability and low complexity requirements of massive antenna systems and massive machine-type communication. We introduce a new variant of the Hard Thresholding Pursuit (HTP) algorithm referred to as HiHTP. We provide both a proof of convergence and a recovery guarantee for noisy Gaussian measurements that exhibit an improved asymptotic scaling in terms of the sampling complexity in comparison with the usual HTP algorithm. Furthermore, hierarchically sparse signals and Kronecker product structured measurements naturally arise together in a variety of applications. We establish the efficient reconstruction of hierarchically sparse signals from Kronecker…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
