Research map / Federated learning and privacy / Differential privacy
Nearly Tight Bounds For Differentially Private Multiway Cut
Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| run the private min s-t cut algorithm instead of the trivial terminal-cut heuristic | DP min s-t cut algorithm · email-Eu-core with random exponential weights, epsilon=0.5 | relative cut error | Improved |
| compare private cut error against the theoretical n/epsilon bound | DP min s-t cut algorithm · email-Eu-core, epsilon=0.5 | additive cut error | Improved |
| vary the privacy parameter epsilon from 1/15 to 1 | DP min s-t cut algorithm · email-Eu-core, 50 instances per epsilon | average private cut value vs terminal cut value | No clear effect |
Closest papers by meaning
- Differentially Private Gomory-Hu Trees (NeurIPS 2025 · similarity 0.91)
- Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition (ICML 2025 · similarity 0.87)
- On the Price of Differential Privacy for Hierarchical Clustering (ICLR 2025 · similarity 0.86)
- Publishing Below-Threshold Triangle Counts under Local Weight Differential Privacy (NeurIPS 2026 · similarity 0.86)
- Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust (NeurIPS 2024 · similarity 0.86)
- A Differentially Private Clustering Algorithm for Well-Clustered Graphs (ICLR 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.
