Research map / Federated learning and privacy / Differential privacy
Differentially-Private Clustering of Easy Instances
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 |
|---|---|---|---|
| Preprocess inputs with FriendlyCore before private aggregation | Differentially private averaging · Basic averaging tasks | sample complexity | Helped |
Closest papers by meaning
- Making Old Things New: A Unified Algorithm for Differentially Private Clustering (ICML 2024 · similarity 0.93)
- Online Differentially Private Consistent Clustering (NeurIPS 2026 · similarity 0.91)
- Differentially Private Federated $k$-Means Clustering with Server-Side Data (ICML 2025 · similarity 0.90)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 2024 · similarity 0.88)
- On the Price of Differential Privacy for Hierarchical Clustering (ICLR 2025 · similarity 0.87)
- Improving the Variance of Differentially Private Randomized Experiments through Clustering (ICML 2025 · similarity 0.87)
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.