AI Paper Atlas

Research map / Federated learning and privacy / Differential privacy

Tight Data Access Bounds for Private Top-$k$ Selection

Hao WU, Olga Ohrimenko, Anthony Wirth

ICML 2023 · Federated learning and privacy › Differential privacy · approach: Privacy accounting and mechanisms · 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
Use both sorted access and random access (threshold algorithm over Gumbel/Laplace-noised scores) for private top-k selectionPrivate top-k selection (private threshold algorithm) · theoretical access cost analysisexpected access costImproved
Apply the exponential mechanism via the same sorted+random access algorithm (k=1, Gumbel noise)Exponential mechanism · theoretical access cost analysisexpected access costImproved
Restrict the system to only random access or only sorted access (not both)Private top-k selection lower bound · theoretical access cost lower boundexpected access cost: Omega(m) lower boundHurt
Pre-generating all m noise values replaced by online on-the-fly sampling of noisy tuples (ablation)Private threshold algorithm (online sampling variant) · theoretical computation time analysisexpected time per accessNo 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