M. Prabhu

collaborators

2 papers

cs.DS2024

Learning Multiple Secrets in Mastermind

Milind Prabhu, David Woodruff

In the Generalized Mastermind problem, there is an unknown subset $H$ of the hypercube ${0, 1}^{d}$ containing $n$ points. The goal is to learn $H$ by making a few queries to an ora…

cs.DS2024

Sensitivity Sampling for $k$ -Means: Worst Case and Stability Optimal Coreset Bounds

Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu +2

Coresets are arguably the most popular compression paradigm for center-based clustering objectives such as $k$ -means. Given a point set $P$ , a coreset $Ω$ is a small, weighted summ…

Learning Multiple Secrets in Mastermind

Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds

Sensitivity Sampling for $k$ -Means: Worst Case and Stability Optimal Coreset Bounds