research
∙
10/14/2022
Multiple Choice Hard Thresholding Pursuit (MCHTP) for Simultaneous Sparse Recovery and Sparsity Order Estimation
We address the problem of sparse recovery using greedy compressed sensin...
share
research
∙
09/28/2022
Online Subset Selection using α-Core with no Augmented Regret
We consider the problem of sequential sparse subset selections in an onl...
research
∙
10/15/2021
k – Online Policies and Fundamental Limits
This paper introduces and studies the k problem – a generalization of th...
research
∙
02/28/2021
Dynamic Sample Complexity for Exact Sparse Recovery using Sequential Iterative Hard Thresholding
In this paper we consider the problem of exact recovery of a fixed spars...
research
∙
01/18/2021
Online Caching with Optimal Switching Regret
We consider the classical uncoded caching problem from an online learnin...
research
∙
10/19/2020
Sparse Recovery Analysis of Generalized J-Minimization with Results for Sparsity Promoting Functions with Monotonic Elasticity
In this paper we theoretically study exact recovery of sparse vectors fr...
research
∙
10/16/2020
On the MMSE Estimation of Norm of a Gaussian Vector under Additive White Gaussian Noise with Randomly Missing Input Entries
This paper considers the task of estimating the l_2 norm of a n-dimensio...
research
∙
08/18/2020
A Two Stage Generalized Block Orthogonal Matching Pursuit (TSGBOMP) Algorithm
Recovery of an unknown sparse signal from a few of its projections is th...
research
∙
06/02/2020
Modified Hard Thresholding Pursuit with Regularization Assisted Support Identification
Hard thresholding pursuit (HTP) is a recently proposed iterative sparse ...
research
∙
04/23/2018