arXiv Machine Learning

Near-Optimal Machine Unlearning Utility for Smooth Strongly Convex Losses

arXiv:2606. 01527v2 Announce Type: replace Abstract: Machine unlearning is motivated by legal and user-facing requirements to remove the influence of individuals' data from trained models, such as the right to be forgotten.

arXiv Machine Learning
Oct 5

Trade-off Functions for DP-SGD with Subsampling based on Random Allocation: Tight Upper and Lower Bounds

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.

By Marten van Dijk, Murat Bilgehan Ertan
arXiv Machine Learning
Oct 22

Differentially Private Sparse Reward Estimation with Preference Feedback

The paper introduces a differentially private framework for sparse reward estimation in reinforcement learning with human feedback (RLHF). It assumes that only a small subset of features influences human preferences and provides theoretical error bounds for both Sample-DP and Label-DP settings under the Bradley-Terry-Luce model. Empirical results show that the proposed methods outperform dense baselines on sentiment generation and safety alignment tasks, achieving a better privacy‑utility trade‑off.

By Meng Ding, Mingxi Lei, Jie Zhang, Jinyan Liu, Di Wang
arXiv Machine Learning
1d ago

Statistical and Privacy Guarantees for Deep M-Regression via Stochastic Gradient Langevin Dynamics

The paper analyzes deep nonparametric regression trained with stochastic gradient Langevin dynamics (SGLD), a stochastic gradient method that adds Gaussian noise. Using a PAC‑Bayesian framework for deep ReLU networks, it derives an excess‑risk bound that incorporates network approximation error, statistical complexity, and the cumulative effect of the SGLD trajectory. The study also provides differential privacy guarantees for per‑sample clipped SGLD and demonstrates the method’s predictive performance and privacy‑utility trade‑offs through simulations and real data experiments.

By Yeheng Ge, Jian Huang, Shuyuan Wu