arXiv:2506. 01396v2 Announce Type: replace Abstract: Differential privacy (DP) has become an essential framework for privacy-preserving machine learning.
By Linzh Zhao, Aki Rehn, Mikko A. Heikkil\"a, Razane Tajeddine, Antti Honkela
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.
By Pan Li, Kai Chen, Shuai Chang, Shengzhi Zhang, Peizhuo Lv, Jinwen He
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.
By Nour Jamoussi, Ikram Dridi, Giuseppe Serra, Marios Kountouris
arXiv:2605. 02701v2 Announce Type: replace-cross Abstract: We propose a robust gradient estimator based on per-sample gradient clipping and analyze its properties both theoretically and empirically.
By Davide Nobile, Philipp Grohs
Machine learning's reliance on sensitive data necessitates privacy-preserving techniques like Differentially Private Stochastic Gradient Descent (DPSGD). However, DPSGD suffers from substantial utility degradation and slow convergence due to gradient clipping and noise injection.
The paper proves that stochastic gradient descent with gradient clipping and additive Gaussian noise (SGD‑CN) converges almost surely under smoothness and bounded noise assumptions, given standard decaying step sizes. The analysis extends to momentum variants such as the stochastic heavy ball and Nesterov's accelerated gradient, showing that careful energy constructions yield similar guarantees. These results provide stronger theoretical foundations for understanding the pathwise behaviour of clipped stochastic gradient methods in both convex and nonconvex regimes.
By Amartya Mukherjee, Jun Liu
arXiv:2606. 04384v1 Announce Type: new Abstract: Machine learning's reliance on sensitive data necessitates privacy-preserving techniques like Differentially Private Stochastic Gradient Descent (DPSGD).
By Xiaobo Huang, Fang Xie
arXiv:2608. 15153v1 Announce Type: cross Abstract: Differentially private federated learning must balance privacy protection against model accuracy and training efficiency.
By Wenjing Wei, Alla Jammine, Farid Nait-Abdesselam
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.
By Xin Gu, Yingtai Xiao, Guanlin He, Jiamu Bai, Daniel Kifer, Kiwan Maeng
arXiv:2606. 01908v1 Announce Type: new Abstract: Test-time adaptation (TTA) can reduce error on new and different data by updating the model on these inputs during inference.
By Zefeng Li, Qiaoyue Tang, Mathias Lecuyer, Evan Shelhamer
arXiv:2602. 06838v3 Announce Type: replace Abstract: Federated learning enables collaborative model training across distributed clients while preserving data privacy.
By Jin Wang, Hui Ma, Yajun Zhang, Xinjun Pei, Ming Yan, Fei Xing, Yikun Chen
The paper provides the first optimization risk bounds for two‑layer Kolmogorov‑Arnold Networks (KANs) trained with clipped mini‑batch differentially private stochastic gradient descent (DP‑SGD) that uses temporally correlated noise. The bounds explicitly capture the effects of temporal correlation, clipping, mini‑batch sampling, and network width, and show that correlation can reduce leading noise terms while the clipping threshold influences an effective step size. Experiments on synthetic data and MNIST confirm the theoretical predictions, and the authors extend the results to population risk guarantees via algorithmic stability, recovering several known special cases.
By Puyu Wang, Jan Schuchardt, Nikita Kalinin, Marcio Monteiro, Junyu Zhou, Sophie Fellenz, Christoph Lampert, Marius Kloft