The paper presents a framework for optimally allocating a fixed privacy budget across iterations of Differentially Private Stochastic Gradient Descent. By modeling the Gaussian noise-variance schedule as an open-loop control problem under a zero-Concentrated Differential Privacy constraint, the authors derive an exact-budget simplex formulation and introduce the Privacy‑Budget Adjoint Mirror Descent (PB‑AMD) algorithm. The method guarantees budget exhaustiveness, stability, and stationarity, and yields a square‑root allocation law that empirically outperforms existing allocation rules and reduces optimization time compared to projected gradient descent.
arXiv:2505. 22703v2 Announce Type: replace Abstract: Many problems in trustworthy ML can be expressed as constraints on prediction rates across subpopulations, including group fairness constraints (demographic parity, equalized odds, etc.
arXiv:2602. 06838v3 Announce Type: replace Abstract: Federated learning enables collaborative model training across distributed clients while preserving data privacy.
arXiv:2407. 08233v3 Announce Type: replace Abstract: Current differentially private learning paradigms face a severe utility bottleneck: DP-SGD degrades performance through noise accumulation over training steps, while aggregation-based approaches such as PATE suffer from data inefficiency due to disjoint data partitioning.
The paper extends the abstract gradient training (AGT) framework to provide tighter differential privacy guarantees for both private prediction and private learning. It introduces Abstract Gradient Sampling (AGS) to analyze privacy in continuous, unbounded regression and offers theoretical and empirical evidence that these methods yield tighter bounds than global-sensitivity baselines, even in previously unbounded settings. The authors also demonstrate that their private learning algorithm can outperform standard private learners under comparable conditions.
arXiv:2512. 04008v2 Announce Type: replace Abstract: Training with differential privacy (DP) guarantees dataset members that they cannot be identified by users of the released model.
arXiv:2607. 23649v1 Announce Type: new Abstract: Differential privacy provides formal privacy guarantees for training neural networks on sensitive data, while Bayesian deep learning offers a principled framework for uncertainty-aware prediction.
arXiv:2607. 05866v1 Announce Type: cross Abstract: Under a fixed privacy budget, the utility of differentially private (DP) training is ultimately determined by its optimization efficiency.
arXiv:2605. 05905v2 Announce Type: replace Abstract: Objective perturbation is a standard mechanism in differentially private empirical risk minimization.
arXiv:2609.14778v1 Announce Type: new Abstract: We propose a decentralized privacy-preserving learning algorithm in which each agent holds a single private sample and a shared model. Samples are lear...
arXiv:2407. 04884v4 Announce Type: replace Abstract: The hidden state threat model of differential privacy (DP) assumes that the adversary has access only to the final trained machine learning (ML) model, without seeing intermediate states during training.
arXiv:2608. 15153v1 Announce Type: cross Abstract: Differentially private federated learning must balance privacy protection against model accuracy and training efficiency.
The paper proposes a method for releasing Gaussian Mixture Models (GMMs) under differential privacy (DP) by minimizing Kullback‑Leibler (KL) divergence between the released and non‑private models. It jointly optimizes privacy‑budget allocation and parameter perturbations for mixture weights, means, and covariances, providing a tractable expression for KL divergence and a theoretical analysis of DP guarantees. Experiments on synthetic and real data show that the approach achieves strong privacy while preserving high utility.