arXiv:2610. 19573v1 Announce Type: cross Abstract: Differential Privacy (DP) provides a rigorous framework for quantifying privacy guarantees.
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: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: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: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.
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.
The paper investigates parametric change‑point detection under local differential privacy, concentrating on offline localization of a single change point in independent observations. It derives improved finite‑sample accuracy guarantees for a generalized likelihood‑ratio estimator using martingale methods and establishes finite‑sample minimax lower bounds in both non‑private and locally private settings, linking localization accuracy to Chernoff information. Guided by these bounds, the authors design locally private algorithms based on aggregated randomized response and binary mechanisms, optimize Chernoff information in different privacy regimes, and provide finite‑sample guarantees, while also computing strong data‑processing inequality coefficients for certain divergences and validating the results empirically on synthetic data.
arXiv:2602. 17284v2 Announce Type: replace Abstract: We consider the privacy amplification properties of a sampling scheme in which a user's data isused in $k$ steps chosen randomly and uniformly from a sequence (or set) of $t$ steps.
arXiv:2610.27710v1 Announce Type: new Abstract: Diffusion models have emerged as the foundation of modern generative systems, yet their high memorization capacity raises privacy concerns. While diffe...
arXiv:2609. 22783v1 Announce Type: new Abstract: We study differentially private covariance estimation in operator norm for mean-zero sub-Gaussian distributions with unknown covariance support and at most $k$ nonzero entries per row.
arXiv:2607. 29675v1 Announce Type: cross Abstract: Density modes provide a localized and interpretable summary of multimodal distributions, but their estimation under rigorous differential privacy constraints remains largely unexplored.
Minimax risk and regret are expectation-based criteria and do not capture rare but consequential failures. To address this concern, we develop a $δ$-explicit minimax-quantile theory for interactive statistical decision making (ISDM).