arXiv:2610. 28878v1 Announce Type: new Abstract: We show that every class of distributions that is learnable up to arbitrarily small target error in total variation distance with finitely many samples is also learnable under ($\varepsilon, \delta$)-differential privacy up to arbitrarily small target error with finitely many samples.
arXiv:2610. 31890v1 Announce Type: new Abstract: We study the PAC-learnability of function classes that map inputs to probability distributions over a finite space.
We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distribution over $\mathcal{X} \times \{0,1\}$, as in clas...
arXiv:2607. 01492v1 Announce Type: new Abstract: Recent work has established a fundamental trilemma between Byzantine robustness, local differential privacy (LDP), and optimization error in distributed learning.
arXiv:2609.24260v1 Announce Type: cross Abstract: We study the problem of \emph{adversarially robust} PAC learning. In this framework, the learner observes independent samples from an unknown distrib...
arXiv:2601. 10237v3 Announce Type: replace Abstract: Differentially Private Stochastic Gradient Descent (DP-SGD) is the dominant paradigm for private training, but its fundamental limitations under worst-case adversarial privacy definitions remain poorly understood.
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.
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: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...
The paper introduces a general framework for non‑interactive locally differentially private (LDP) learning of structured univariate distributions that can be approximated by piece‑wise polynomials. It achieves the first sample‑efficient LDP learners for several distribution classes, notably mixtures of log‑concave distributions such as Gaussian mixture models (GMMs), while providing agnostic guarantees and computational efficiency. The authors also establish a new lower bound for learning GMMs under LDP, surpassing previous pure‑DP packing bounds, and develop an efficient non‑interactive LDP algorithm for synthetic data generation over large domains, which is then combined with a deterministic adaptation of a non‑private piecewise polynomial learner.
arXiv:2603. 19040v2 Announce Type: replace Abstract: Differentially private wireless federated learning (DPWFL) is a promising framework for protecting sensitive user data.
The paper investigates federated learning over multiple‑access fading channels with a multi‑antenna base station, focusing on user‑level differential privacy (DP). It shows that DP can be achieved as a natural benefit of channel noise without adding artificial noise, deriving new DP and convergence bounds for general bounded‑domain models and non‑convex loss functions. The authors further optimize beamforming and power allocation to characterize the trade‑off between privacy and convergence, providing theoretical insights and numerical validation.
arXiv:2608.30246v1 Announce Type: cross Abstract: The fundamental theorem of statistical learning states that, under suitable measurability assumptions, finite Vapnik--Chervonenkis (VC) dimension gua...