Search Results for author: Samrat Mukhopadhyay

Found 5 papers, 0 papers with code

$k\texttt{-experts}$ -- Online Policies and Fundamental Limits

no code implementations15 Oct 2021 Samrat Mukhopadhyay, Sourav Sahoo, Abhishek Sinha

This paper introduces and studies the $k\texttt{-experts}$ problem -- a generalization of the classic Prediction with Expert's Advice (i. e., the $\texttt{Experts}$) problem.

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

no code implementations28 Feb 2021 Samrat Mukhopadhyay

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.

Online Caching with Optimal Switching Regret

no code implementations18 Jan 2021 Samrat Mukhopadhyay, Abhishek Sinha

The objective is to design a caching policy that incurs minimal regret while considering both the rewards due to cache-hits and the switching cost due to the file fetches.

A Two Stage Generalized Block Orthogonal Matching Pursuit (TSGBOMP) Algorithm

no code implementations18 Aug 2020 Samrat Mukhopadhyay, Mrityunjoy Chakraborty

Furthermore, assuming real Gaussian sensing matrix entries, we find a lower bound on the probability that the derived recovery bounds are satisfied.

Modified Hard Thresholding Pursuit with Regularization Assisted Support Identification

no code implementations2 Jun 2020 Samrat Mukhopadhyay, Mrityunjoy Chakraborty

Hard thresholding pursuit (HTP) is a recently proposed iterative sparse recovery algorithm which is a result of combination of a support selection step from iterated hard thresholding (IHT) and an estimation step from the orthogonal matching pursuit (OMP).

Cannot find the paper you are looking for? You can Submit a new open access paper.