KL-regularization Itself is Differentially Private in Bandits and RLHF
On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF
Abstract (arXiv)
Differential Privacy (DP) provides a rigorous framework for privacy, ensuring the outputs of data-driven algorithms remain statistically indistinguishable across datasets that differ in a single entry. While guaranteeing DP generally requires explicitly injecting noise either to the algorithm itself or to its outputs, the intrinsic randomness of existing algorithms presents an opportunity to achieve DP ``for free''. In this work, we explore the role of regularization in achieving DP across three different decision-making problems: multi-armed bandits, linear contextual bandits, and reinforcement learning from human feedback (RLHF), in offline data settings. We show that adding KL-regularization to the learning objective (a common approach in optimization algorithms) makes the action sampled from the resulting stochastic policy itself differentially private. This offers a new route to privacy guarantees without additional noise injection, while also preserving the inherent advantage of regularization in enhancing performance.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 47 of its 65 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
47 of 65 references.
Closest ancestors · 7
Same direction, newest first
- 2024Sharp Analysis for KL-Regularized Contextual Bandits and RLHF7 Nov
- 2023Iterative Preference Learning from Human Feedback: Bridging Theory and Practice for RLHF under KL-Constraint18 Dec
- 2023Differentially Private Reward Estimation with Preference Feedback30 Oct
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Model29 May
- 2023Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise Comparisons26 Jan
- 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback12 Apr
- 2019Fine-Tuning Language Models from Human Preferences18 Sep
Other references · 40
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Trust Region Policy Optimizationcited by 2,580
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 669
- 2020Is Pessimism Provably Efficient for Offline RL?cited by 364
- 2019A Theory of Regularized Markov Decision Processescited by 286
- 2021Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimismcited by 279
- 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 272
- 2020On the Global Convergence Rates of Softmax Policy Gradient Methodscited by 264
- 2019On the Theory of Policy Gradient Methods: Optimality, Approximation, and Distribution Shiftcited by 177
28 more
- 2020Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularizationcited by 176
- 2021Deep Learning with Label Differential Privacycited by 117
- 2015Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challengescited by 114
- 2022Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexitycited by 85
- 2018Differentially Private Contextual Linear Banditscited by 82
- 2016Conservative Contextual Linear Banditscited by 57
- 2024The Importance of Online Data: Understanding Preference Fine-tuning via Coveragecited by 55
- 2020Locally Differentially Private (Contextual) Bandits Learningcited by 53
- 2020Private Reinforcement Learning with PAC and Regret Guaranteescited by 51
- 2018Privacy-preserving Predictioncited by 48
- 2023The Blessing of Heterogeneity in Federated Q-Learning: Linear Speedup and Beyondcited by 36
- 2016Efficient Algorithms for Adversarial Contextual Learningcited by 33
- 2021Generalized Linear Bandits with Local Differential Privacycited by 29
- 2022When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Banditscited by 28
- 2020The Trade-Offs of Private Predictioncited by 22
- 2018Differential Privacy Techniques for Cyber Physical Systems: A Surveycited by 21
- 2022Pessimism for Offline Linear Contextual Bandits using ℓp Confidence Setscited by 18
- 2023Privately Aligning Language Models with Reinforcement Learningcited by 17
- 2023Provably Feedback-Efficient Reinforcement Learning via Active Reward Learningcited by 15
- 2025Towards User-level Private Reinforcement Learning with Human Feedbackcited by 14
- 2023Concentrated Differential Privacy for Banditscited by 10
- 2019PAC learning with stable and private predictionscited by 9
- 2018Regularized Contextual Banditscited by 4
- 2025Differentially Private Policy Gradientcited by 3
- 2021Dirichlet Mechanism for Differentially Private KL Divergence Minimizationcited by 2
- 2019Differential Privacy in the 2020 Decennial Census and the Implications for Available Data Productscited by 1
- 2020Stability Enhanced Privacy and Applications in Private Stochastic Gradient Descentcited by 1
- 2021Differential Privacy for Credit Risk Modelcited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2022On the utility and protection of optimization with differential privacy and classic regularization techniques
- 2026Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits
- 2025On the Sample Complexity of Differentially Private Policy Optimization
- 2026Privacy-Preserving Reinforcement Learning from Human Feedback via Decoupled Reward Modeling
- 2026Randomized Least Squares Value Iteration itself is Joint Differentially Private
- 2025Towards Optimal Differentially Private Regret Bounds in Linear MDPs
- 2026Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
- 2022Offline Reinforcement Learning with Differential Privacy