7 citations · 36 across the 24 of their papers we have counts for
6 papers · 1 filter
Random Subgraph Detection Using Queries
Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal
The planted densest subgraph detection problem refers to the task of testing whether in a given (random) graph there is a subgraph that is unusually dense. Specifically, we observe…
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians
Sami Davies, Arya Mazumdar, Soumyabrata Pal +1
Mixtures of high dimensional Gaussian distributions have been studied extensively in statistics and learning theory. While the total variation distance appears naturally in the sam…
Support Recovery in Universal One-bit Compressed Sensing
Arya Mazumdar, Soumyabrata Pal
One-bit compressed sensing (1bCS) is an extreme-quantized signal acquisition method that has been intermittently studied in the past decade. In 1bCS, linear samples of a high dimen…
Support Recovery of Sparse Signals from a Mixture of Linear Measurements
Venkata Gandikota, Arya Mazumdar, Soumyabrata Pal
Recovery of support of a sparse vector from simple measurements is a widely-studied problem, considered under the frameworks of compressed sensing, 1-bit compressed sensing, and mo…
Fuzzy Clustering with Similarity Queries
Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal
The fuzzy or soft -means objective is a popular generalization of the well-known -means problem, extending the clustering capability of the -means to datasets that are unc…
Learning User Preferences in Non-Stationary Environments
Wasim Huleihel, Soumyabrata Pal, Ofer Shayevitz
Recommendation systems often use online collaborative filtering (CF) algorithms to identify items a given user likes over time, based on ratings that this user and a large number o…