REVIEW 4 cited by
The Permute-and-Flip Mechanism is Identical to Report-Noisy-Max with Exponential Noise
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Permute-and-Flip Mechanism is Identical to Report-Noisy-Max with Exponential Noise
read the original abstract
The permute-and-flip mechanism is a recently proposed differentially private selection algorithm that was shown to outperform the exponential mechanism. In this paper, we show that permute-and-flip is equivalent to the well-known report noisy max algorithm with exponential noise.
Forward citations
Cited by 4 Pith papers
-
DPrivBench: Benchmarking LLMs' Reasoning for Differential Privacy
DPrivBench shows that top LLMs handle basic differential privacy mechanisms but fail on advanced algorithms, exposing gaps in automated DP reasoning.
-
DPrivBench: Benchmarking LLMs' Reasoning for Differential Privacy
DPrivBench is a new benchmark for evaluating LLMs on differential privacy reasoning, with results showing good performance on textbook mechanisms but substantial failures on advanced algorithms.
-
Differentially Private and Federated Structure Learning in Bayesian Networks
Fed-Sparse-BNSL combines differential privacy with sparse greedy updates to learn linear Gaussian Bayesian network structures in a federated setting while keeping communication low and utility close to non-private baselines.
-
Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise
New privacy analysis for SVT enables exponential noise plus threshold correction and appending, raising precision and recall up to 50%.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.