arXiv Statistics ML
One-Shot Private Confidence Regions via Resampling
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Oct 15
On Inherent Privacy of Posterior Sampling: A Unified R\'enyi-Divergence Framework
arXiv:2610. 19573v1 Announce Type: cross Abstract: Differential Privacy (DP) provides a rigorous framework for quantifying privacy guarantees.
Hugging Face Trending Papers
Aug 3
Private Generative Bootstrap via Blocking
With AI systems gaining more access to individuals' information, it is important to protect privacy when reporting statistical answers. Equally important is to privatize the reporting of uncertainty in such answers.
arXiv Machine Learning
Aug 4
Private Generative Bootstrap via Blocking
arXiv:2608. 02480v1 Announce Type: cross Abstract: With AI systems gaining more access to individuals' information, it is important to protect privacy when reporting statistical answers.
arXiv Machine Learning
Jun 5
Minimax optimal differentially private synthetic data for smooth queries
arXiv:2602. 01607v3 Announce Type: replace-cross Abstract: Differentially private synthetic data enables the sharing and analysis of sensitive datasets while providing rigorous privacy guarantees for individual contributors.
arXiv Machine Learning
Oct 5
Trade-off Functions for DP-SGD with Subsampling based on Random Allocation: Tight Upper and Lower Bounds
arXiv:2605. 06259v3 Announce Type: replace Abstract: Within the $f$-DP framework, we derive a tight analysis of the trade-off function for Differentially Private Stochastic Gradient Descent (DP-SGD) with subsampling based on random allocation in which each sample is independently assigned to exactly one of $M$ minibatches per epoch, each minibatch corresponding to one of the $M$ SGD rounds within a single epoch.
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.