Ada-JSR: Sample Efficient Adaptive Joint Support Recovery From Extremely Compressed Measurement Vectors
Sina Shahsavari, Pulak Sarangi, Mehmet Can Hücümenoglu, Piya Pal
Abstract
This paper considers the problem of recovering the joint support (of size K) of a set of unknown sparse vectors in ℝ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</sup> , each of which can be sensed using a different measurement matrix. Such models have wide applicability ranging from communication to multi-task learning. We develop an adaptive strategy called Adaptive Joint Support Recovery (Ada- JSR) that enables exact support recovery in the extreme compression regime with only m = 1 measurement per unknown vector while requiring a total complexity of no more than K⌈log <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> (d)⌉ measurements. Unlike existing support recovery techniques which require suitable assumptions on the correlation structure or distribution of the unknown signals in order to operate in the regime m < K, we show that the flexibility of adaptive measurement design alone allows us to operate in this extreme compression regime, without the need for imposing any correlation or sub-Gaussian priors. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup>
BibTeX
@inproceedings{icassp2022_adajsrsampleeffi,
title = {Ada-JSR: Sample Efficient Adaptive Joint Support Recovery From Extremely Compressed Measurement Vectors},
author = {Sina Shahsavari and Pulak Sarangi and Mehmet Can Hücümenoglu and Piya Pal},
booktitle = {ICASSP 2022},
year = {2022}
}