Read original ↗
paperarXivTrust 82 · PrimaryPublished 10d agoLive · 9d ago

Dithered Gaussian Mechanism for Randomness-Efficient Differential Privacy

We present the dithered Gaussian mechanism, a novel alternative to the discrete Gaussian mechanism for differential privacy that discretizes the private output rather than the noise distribution itself. By interpreting this discretization as post-processing of the Gaussian mechanism, our construction directly inherits the privacy guarantees of the standard Gaussian mechanism while avoiding vulnerabilities caused by finite-precision floating-point outputs. We show that the mechanism is provably randomness-efficient: by sampling the discretized output values directly, the number of high-quality

Lineage graph

Paper → model → repo connections mined from source citations (Tier-1 exact match).

Why these links exist

Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.

  • LinkedLinked via arxiv author · 85%Nikita P. Kalinin

    Dithered Gaussian Mechanism for Randomness-Efficient Differential Privacy

  • LinkedLinked via arxiv author · 85%Rasmus Pagh

    Dithered Gaussian Mechanism for Randomness-Efficient Differential Privacy

  • PossiblePossibly related (embedding) · 56%meta-pytorch/opacus

authored (incoming)

Implements (incoming)

Related across the graph

Topics