activity
20172024
most citedSupport Recovery in Universal One-bit Compressed Sensing

7 citations · 28 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG20241 cited

Online Matrix Completion: A Collaborative Approach with Hott Items

Dheeraj Baby, Soumyabrata Pal

We investigate the low rank matrix completion problem in an online setting with users, items, rounds, and an unknown rank- reward matrix ${R}\in \mathbb{R}^{{M…

cs.LG20211 cited

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…

cs.LG20212 cited

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…

cs.LG2020

Algebraic and Analytic Approaches for Parameter Learning in Mixture Models

Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor +1

We present two different approaches for parameter learning in several mixture models in one dimension. Our first approach uses complex-analytic methods and applies to Gaussian mixt…

cs.LG20195 cited

Sample Complexity of Learning Mixtures of Sparse Linear Regressions

Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor +1

In the problem of learning mixtures of linear regressions, the goal is to learn a collection of signal vectors from a sequence of (possibly noisy) linear measurements, where each m…

cs.LG20196 cited

Same-Cluster Querying for Overlapping Clusters

Wasim Huleihel, Arya Mazumdar, Muriel Médard +1

Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given elements to be clustered into possibly overlapping clusters…