arXiv Machine Learning By Leoni Carla Wirth, Tara Trautwein, Gesine Reinert

Task-aware Kernel Stein certificates for R\'{e}nyi differential privacy

Read the original on arXiv Machine Learning →

The paper introduces task‑aware kernel Stein certificates for Rényi differential privacy, leveraging kernel Stein discrepancies based on escort distributions to provide privacy guarantees. By tailoring the kernel to focus on relevant privacy directions, the authors derive exact identities for Gaussian and Laplace mechanisms and bounds for exponential mechanisms, including task‑aware guarantees. A real‑world data example demonstrates how the protected comparison set and the released subspace jointly influence the resulting certificates.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 15

Let's Ask Gauss: Improved One-Run Privacy Auditing

arXiv:2606. 12733v2 Announce Type: replace Abstract: Privacy auditing provides an important safeguard by estimating the actual information leaked by a model, thus ensuring that theoretical privacy guarantees hold in practice.

By Adya Agrawal, Yu Wei, Jaspal Singh, Malik Magdon-Ismail, Vassilis Zikas
arXiv Machine Learning
Oct 28

Gaussian Approximation for Composition and Subsampling of Differentially Private Algorithms

The paper presents a Gaussian approximation for the privacy loss distribution in differentially private stochastic gradient descent (DP‑SGD) when subsampling is used. It shows that, after truncating rare large losses, the privacy loss behaves like a Gaussian with the same mean and variance, up to a small shift that grows only logarithmically with the error tolerance. This leads to tighter variance‑based bounds for subsampled mechanisms, improving upon previous Renyi‑divergence analyses and explaining the effectiveness of the connect‑the‑dots method for random allocation sampling.

By Vitaly Feldman, Moshe Shenfeld