mlsanityData to 7 Oct 2026

Differentially Private Reward Estimation with Preference Feedback

arXiv 2310.19733 ↗First posted 30 Oct 2023cs.LG cs.CRcited by 12

On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF

Abstract (arXiv)

Learning from preference-based feedback has recently gained considerable traction as a promising approach to align generative models with human interests. Instead of relying on numerical rewards, the generative models are trained using reinforcement learning with human feedback (RLHF). These approaches first solicit feedback from human labelers typically in the form of pairwise comparisons between two possible actions, then estimate a reward model using these comparisons, and finally employ a policy based on the estimated reward model. An adversarial attack in any step of the above pipeline might reveal private and sensitive information of human labelers. In this work, we adopt the notion of label differential privacy (DP) and focus on the problem of reward estimation from preference-based feedback while protecting privacy of each individual labelers. Specifically, we consider the parametric Bradley-Terry-Luce (BTL) model for such pairwise comparison feedback involving a latent reward parameter θ^* ∈ ℝd. Within a standard minimax estimation framework, we provide tight upper and lower bounds on the error in estimating θ^* under both local and central models of DP. We show, for a given privacy budget ε and number of samples n, that the additional cost to ensure label-DP under local model is Theta big(frac1 eε-1√fracdnbig), while it is Thetabig(fracpoly(d)ε n big) under the weaker central model. We perform simulations on synthetic data that corroborate these theoretical results.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 26 of its 61 references that are in the map. First posted on arXiv 30 Oct 2023.

Builds on

26 of 61 references.

Closest ancestors · 3

Same direction, newest first

  1. 2023Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise Comparisons26 Jan
  2. 2023Benchmarks and Algorithms for Offline Preference-Based Reward Learning3 Jan
  3. 2017Deep reinforcement learning from human preferences12 Jun

Other references · 23

  1. 2022Improving alignment of dialogue agents via targeted human judgementscited by 527
  2. 2021Differentially Private Fine-tuning of Language Modelscited by 392
  3. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  4. 2023Multi-step Jailbreaking Privacy Attacks on ChatGPTcited by 320
  5. 2019Private Stochastic Convex Optimization with Optimal Ratescited by 183
  6. 2017Interactive Learning from Policy-Dependent Human Feedbackcited by 155
  7. 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?cited by 135
  8. 2021Deep Learning with Label Differential Privacycited by 113
  9. 2021Dueling RL: Reinforcement Learning with Trajectory Preferencescited by 105
  10. 2016Minimax Optimal Procedures for Locally Private Estimationcited by 103
  11. 2018Preference-based Online Learning with Dueling Bandits: A Surveycited by 100
  12. 2018Differentially Private Contextual Linear Banditscited by 82
11 more
  1. 2022Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximationcited by 80
  2. 2022Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimismcited by 63
  3. 2014Private Learning and Sanitization: Pure vs. Approximate Differential Privacycited by 62
  4. 2015Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependencecited by 59
  5. 2020Differentially Private Assouad, Fano, and Le Camcited by 54
  6. 2021Antipodes of Label Differential Privacy: PATE and ALIBIcited by 50
  7. 2022Privately Fine-Tuning Large Language Models with Differential Privacycited by 39
  8. 2022Shuffle Private Linear Contextual Banditscited by 27
  9. 2023Score Attack: A Lower Bound Technique for Optimal Differentially Private Learningcited by 21
  10. 2021Label differential privacy via clusteringcited by 20
  11. 2022Pessimism for Offline Linear Contextual Bandits using ℓp Confidence Setscited by 18

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 7; 2026: 3.

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Capturing Individual Human Preferences with Reward Features
  2. 2023A density estimation perspective on learning from pairwise human preferences
  3. 2025PILAF: Optimal Human Preference Sampling for Reward Modeling
  4. 2024Sail into the Headwind: Alignment via Robust Rewards and Dynamic Labels against Reward Hacking
  5. 2026Variance-aware Reward Modeling with Anchor Guidance
  6. 2026Reinforcement Learning from Human Feedback: A Statistical Perspective
  7. 2024Preference Poisoning Attacks on Reward Model Learning
  8. 2026Reward-Driven Learning under Prompt-Level Differential Privacy