AI Paper Atlas

Research map / Federated learning and privacy / Differential privacy

Nearly Tight Bounds For Differentially Private Multiway Cut

Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka

NeurIPS 2023 · Federated learning and privacy › Differential privacy · approach: Differentially private clustering · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
run the private min s-t cut algorithm instead of the trivial terminal-cut heuristicDP min s-t cut algorithm · email-Eu-core with random exponential weights, epsilon=0.5relative cut errorImproved
compare private cut error against the theoretical n/epsilon boundDP min s-t cut algorithm · email-Eu-core, epsilon=0.5additive cut errorImproved
vary the privacy parameter epsilon from 1/15 to 1DP min s-t cut algorithm · email-Eu-core, 50 instances per epsilonaverage private cut value vs terminal cut valueNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy