3 citations · 5 across the 4 of their papers we have counts for
5 papers
Streaming Submodular Maximization with Differential Privacy
Anamay Chaturvedi, Huy Lê Nguyen, Thy Nguyen
In this work, we study the problem of privately maximizing a submodular function in the streaming setting. Extensive work has been done on privately maximizing submodular functions…
Improved Learning-augmented Algorithms for k-means and k-medians Clustering
Thy Nguyen, Anamay Chaturvedi, Huy Lê Nguyen
We consider the problem of clustering in the learning-augmented setting, where we are given a data set in -dimensional Euclidean space, and a label for each data point given by…
An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret
Matthew Jones, Huy Lê Nguyen, Thy Nguyen
Recently a multi-agent variant of the classical multi-armed bandit was proposed to tackle fairness issues in online learning. Inspired by a long line of work in social choice and e…
Fair Range k-center
Huy Lê Nguyen, Thy Nguyen, Matthew Jones
We study the problem of fairness in k-centers clustering on data with disjoint demographic groups. Specifically, this work proposes a variant of fairness which restricts each group…
Differentially Private Clustering via Maximum Coverage
Matthew Jones, Huy Lê Nguyen, Thy Nguyen
This paper studies the problem of clustering in metric spaces while preserving the privacy of individual data. Specifically, we examine differentially private variants of the k-med…