Differentially Private Natural Gradient Descent
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.
The paper investigates high‑dimensional LASSO under differential privacy using objective perturbation when covariates have heterogeneous scales. It introduces a Gram‑based anisotropic objective perturbation that counteracts the distortion caused by covariate heterogeneity, restoring isotropy in the estimation process. Through an Approximate Message Passing framework and state evolution analysis, the authors show that this approach stabilizes convergence and improves both statistical efficiency and privacy performance compared to standard uniform noise injection.
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:2508.04800v2 Announce Type: replace-cross Abstract: We introduce a novel privatization framework for high-dimensional controlled variable selection. Our framework enables rigorous False Discove...
arXiv:2602. 06838v3 Announce Type: replace Abstract: Federated learning enables collaborative model training across distributed clients while preserving data privacy.
arXiv:2606. 18773v1 Announce Type: cross Abstract: We study differentially private (DP) regression in settings where each data sample includes public, non-sensitive features -- common in applications such as recommendation and advertising systems.
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:2303. 07152v3 Announce Type: replace-cross Abstract: Achieving optimal statistical performance while ensuring the privacy of personal data is a challenging yet crucial objective in modern data analysis.
The paper introduces Jacobian-Guided Anisotropic Noise Reshaping, a method that improves data utility under Local Differential Privacy by selectively reducing noise in task-relevant subspaces of data representations. It uses the Jacobian of a public downstream model to identify critical directions and reshapes isotropic LDP noise into an anisotropic distribution, preserving privacy while enhancing performance. Experiments on CIFAR-10-C show significant accuracy gains, especially for PrivUnit variants at ε=7.5.
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:2605. 05905v2 Announce Type: replace Abstract: Objective perturbation is a standard mechanism in differentially private empirical risk minimization.
arXiv:2510. 05416v3 Announce Type: replace Abstract: Differentially private stochastic gradient descent (DP-SGD) offers the promise of training deep learning models while mitigating many privacy risks.
The paper proposes a privacy‑aligned personalized federated learning method that releases a private client context once and limits repeated adaptation to a fixed coefficient space, thereby reducing dimensionality misalignment. A factorized generator creates an adaptive optimization geometry that reshapes noisy updates, and most of the private‑training benefit is preserved by radial evolution. Variable‑length Gaussian quantization is used for coefficient updates, allowing the quantization error to act as the privacy perturbation and cutting protected uplink communication by a factor of 2.67 on CIFAR‑10 at ε=16 while maintaining comparable future‑client accuracy.
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.