Research map / Federated learning and privacy / Differential privacy
Differentially Private k-Means via Exponential Mechanism and Max Cover
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace prior candidate-center selection with grid-based maximum coverage and the exponential mechanism | Differentially private k-means · k-means theoretical comparison | additive error: \tilde{O}(k \sqrt{d}) versus \tilde{O}\big(k + d^{0.5 + \gamma} k^{1 + \gamma} \big) | Helped |
| Use grid-based maximum coverage instead of the prior LSH approach | Differentially private k-means · k-means theoretical comparison | multiplicative error: O(1/\gamma) -> O(1) | Helped |
Closest papers by meaning
- Online Differentially Private Consistent Clustering (NeurIPS 2026 · similarity 0.91)
- Making Old Things New: A Unified Algorithm for Differentially Private Clustering (ICML 2024 · similarity 0.89)
- Differentially Private Federated $k$-Means Clustering with Server-Side Data (ICML 2025 · similarity 0.89)
- On the Price of Differential Privacy for Hierarchical Clustering (ICLR 2025 · similarity 0.88)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.87)
- Differential Privacy in Scalable General Kernel Learning via $K$-means Nystr{\"o}m Random Features (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.