Matthew D. Jones

activity

20182022

collaborators

4 papers

cs.LG2022

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…

cs.DS2021

Locally Private $k$ -Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error

Anamay Chaturvedi, Matthew Jones, Huy L. Nguyen

Given a data set of size $n$ in $d^{'}$ -dimensional Euclidean space, the $k$ -means problem asks for a set of $k$ points (called centers) so that the sum of the $ℓ_{2}^{2}$ -distances be…

cs.DS2020

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…

cs.CG2018

Maximum Area Axis-Aligned Square Packings

Hugo A. Akitaya, Matthew D. Jones, David Stalfa +1

Given a point set $S = {s_{1}, \dots, s_{n}}$ in the unit square $U = [0, 1]^{2}$ , an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_{i}$ is a co…

An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret

Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error

Differentially Private Clustering via Maximum Coverage

Maximum Area Axis-Aligned Square Packings

Locally Private $k$ -Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error