1 citations · 1 across the 6 of their papers we have counts for
9 papers
Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
Dhruv Sarkar, Samrat Mukhopadhyay, Abhishek Sinha
We study an online learning problem with long-term budget constraints in the adversarial setting. In this problem, at each round , the learner selects an action from a convex de…
Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
Samrat Mukhopadhyay, Debasmita Mukherjee
We consider the problem of \textit{online sparse linear approximation}, where one predicts the best sparse approximation of a sequence of measurements in terms of linear combinatio…
Multiple Choice Hard Thresholding Pursuit (MCHTP) for Simultaneous Sparse Recovery and Sparsity Order Estimation
Samrat Mukhopadhyay, Himanshu Bhusan Mishra
We address the problem of sparse recovery using greedy compressed sensing recovery algorithms, without explicit knowledge of the sparsity. Estimating the sparsity order is a crucia…
Dynamic Sample Complexity for Exact Sparse Recovery using Sequential Iterative Hard Thresholding
Samrat Mukhopadhyay
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 propo…
Online Caching with Optimal Switching Regret
Samrat Mukhopadhyay, Abhishek Sinha
We consider the classical uncoded caching problem from an online learning point-of-view. A cache of limited storage capacity can hold files at a time from a large catalog. A us…
Sparse Recovery Analysis of Generalized -Minimization with Results for Sparsity Promoting Functions with Monotonic Elasticity
Samrat Mukhopadhyay
In this paper we theoretically study exact recovery of sparse vectors from compressed measurements by minimizing a general nonconvex function that can be decomposed into the sum of…