Dynamic Sample Complexity for Exact Sparse Recovery using Sequential Iterative Hard Thresholding

02/28/2021
by   Samrat Mukhopadhyay, et al.
0

In this paper we consider the problem of exact recovery of a fixed sparse vector with the measurement matrices sequentially arriving along with corresponding measurements. We propose an extension of the iterative hard thresholding (IHT) algorithm, termed as sequential IHT (SIHT) which breaks the total time horizon into several phases such that IHT is executed in each of these phases using a fixed measurement matrix obtained at the beginning of that phase. We consider a stochastic setting where the measurement matrices obtained at each phase are independent samples of a sub Gaussian random matrix. We prove that if a certain dynamic sample complexity that depends on the sizes of the measurement matrices at each phase, along with their duration and the number of phases, satisfy certain lower bound, the estimation error of SIHT over a fixed time horizon decays rapidly. Interestingly, this bound reveals that the probability of decay of estimation error is hardly affected even if very small number measurements are sporadically used in different phases. This theoretical observation is also corroborated using numerical experiments demonstrating that SIHT enjoys improved probability of recovery compared to offline IHT.

READ FULL TEXT

Authors

page 1

12/05/2017

Optimal Sample Complexity for Stable Matrix Recovery

Tremendous efforts have been made to study the theoretical and algorithm...
01/30/2021

Phase Transition for Support Recovery from Gaussian Linear Measurements

We study the problem of recovering the common k-sized support of a set o...
05/18/2020

Sparse Signal Recovery From Phaseless Measurements via Hard Thresholding Pursuit

In this paper, we consider the sparse phase retrival problem, recovering...
05/12/2022

Sketching sparse low-rank matrices with near-optimal sample- and time-complexity

We consider the problem of recovering an n_1 × n_2 low-rank matrix with ...
11/19/2020

Estimation of Shortest Path Covariance Matrices

We study the sample complexity of estimating the covariance matrix Σ∈ℝ^d...
05/20/2021

Multi-Frequency Phase Retrieval for Antenna Measurements

Phase retrieval problems in antenna measurements arise when a reference ...
05/20/2008

High-dimensional subset recovery in noise: Sparsified measurements without loss of statistical efficiency

We consider the problem of estimating the support of a vector β^* ∈R^p b...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.