SquarechiPO: Differentially Private and Robust chi2-Preference Optimization in Offline Direct Alignment
On the map: LLM alignment / RLHF / preference optimisation → Human values and AI feedback alignment
Abstract (arXiv)
In this paper, we theoretically study the offline alignment of language models with human preference feedback, under both preference label corruption and privacy protections. To this end, we propose SquarechiPO, a simple one-line change to chiPO where the standard log-loss is replaced by a new square loss over probability. Thanks to the inherent properties of this new loss, we have advanced the state-of-the-art of differentially private and robust offline direct alignment. Specifically, for the local model of label privacy, SquarechiPO is the first algorithm that attains an optimal rate based on single-policy concentrability even with general function approximations. It also gives the first result under the central model of privacy protection over both prompts (responses) and labels. On the robustness side against Huber label corruption, SquarechiPO is the first alignment method that has a meaningful theoretical guarantee under general function approximations. More importantly, SquarechiPO can address privacy protection and corruption simultaneously, where an interesting separation is observed, implying that the order of privacy and corruption matters. Furthermore, we show that SquarechiPO can also be easily extended to handle the scenario of the general preference model with state-of-the-art guarantees under corruption and privacy. Last but not least, all of our theoretical guarantees enjoy a unified analysis, building upon a new result on the generalization error bounds of least-square regression under corruption and privacy constraints, which we believe is of independent interest to the community.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Human values and AI feedback alignment, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 70 of its 96 references that are in the map. First posted on arXiv 27 May 2025.
Builds on
70 of 96 references.
Closest ancestors · 4
Same direction, newest first
- 2025A Unified Theoretical Analysis of Private and Robust Offline Alignment: from RLHF to DPO21 May
- 2024Exposing Privacy Gaps: Membership Inference Attack on Preference Data for LLM Alignment8 Jul
- 2022Constitutional AI: Harmlessness from AI Feedback15 Dec
- 2020Learning to summarize from human feedback2 Sep
Other references · 66
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,720
- 2019Fine-Tuning Language Models from Human Preferencescited by 2,150
- 2023A General Theoretical Paradigm to Understand Learning from Human Preferencescited by 912
- 2023Open Problems and Fundamental Limitations of Reinforcement Learning from Human Feedbackcited by 759
- 2023SLiC-HF: Sequence Likelihood Calibration with Human Feedbackcited by 401
- 2021Differentially Private Fine-tuning of Language Modelscited by 400
- 2023Statistical Rejection Sampling Improves Preference Optimizationcited by 323
38 more
- 2023Principle-Driven Self-Alignment of Language Models from Scratch with Minimal Human Supervisioncited by 318
- 2019Information-Theoretic Considerations in Batch Reinforcement Learningcited by 287
- 2021Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimismcited by 279
- 2021Bellman-consistent Pessimism for Offline Reinforcement Learningcited by 269
- 2023Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise Comparisonscited by 247
- 2024Self-Play Preference Optimization for Language Model Alignmentcited by 232
- 2023Nash Learning from Human Feedbackcited by 224
- 2024Direct Nash Optimization: Teaching Language Models to Self-Improve with General Preferencescited by 178
- 2023Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraintscited by 174
- 2021Pessimistic Model-based Offline Reinforcement Learning under Partial Coveragecited by 164
- 2022Hybrid RL: Using Both Offline and Online Data Can Make RL Efficientcited by 161
- 2024Generalized Preference Optimization: A Unified Approach to Offline Alignmentcited by 157
- 2024A Minimaximalist Approach to Reinforcement Learning from Human Feedbackcited by 144
- 2024Provably Robust DPO: Aligning Language Models with Noisy Feedbackcited by 135
- 2022Offline Reinforcement Learning with Realizability and Single-policy Concentrabilitycited by 123
- 2021OptiDICE: Offline Policy Optimization via Stationary Distribution Correction Estimationcited by 121
- 2020Minimax-Optimal Off-Policy Evaluation with Linear Function Approximationcited by 120
- 2024Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizercited by 109
- 2024Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHFcited by 106
- 2023Is RLHF More Difficult than Standard RL?cited by 96
- 2022The Role of Coverage in Online Reinforcement Learningcited by 83
- 2018Differentially Private Contextual Linear Banditscited by 82
- 2024Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimizationcited by 78
- 2024On the Algorithmic Bias of Aligning Large Language Models with RLHF: Preference Collapse and Matching Regularizationcited by 72
- 2024REBEL: Reinforcement Learning via Regressing Relative Rewardscited by 69
- 2023Benchmarks and Algorithms for Offline Preference-Based Reward Learningcited by 56
- 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
- 2022Robustness Implies Privacy in Statistical Estimationcited by 47
- 2024Dataset Reset Policy Optimization for RLHFcited by 41
- 2019An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rulecited by 37
- 2020Multi-Armed Bandits with Local Differential Privacycited by 37
- 2022Shuffle Private Linear Contextual Banditscited by 27
- 2022Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimationcited by 25
- 2021Differentially Private Regret Minimization in Episodic Markov Decision Processescited by 23
- 2020Local Differential Privacy for Regret Minimization in Reinforcement Learningcited by 22
- 2022Differentially Private Reinforcement Learning with Linear Function Approximationcited by 22
50 most cited of 66 All 66 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Improved Algorithms for Differentially Private Language Model Alignment
- 2025PROPS: Progressively Private Self-alignment of Large Language Models
- 2023Privately Aligning Language Models with Reinforcement Learning
- 2026Differentially Private Preference Data Synthesis for Large Language Model Alignment
- 2026Private Direct Preference Optimization for LLM Alignment
- 2026Balancing Privacy, Utility, and Safety in LLM Alignment through Preference Optimization
- 2025Offline and Online KL-Regularized RLHF under Differential Privacy
- 2026Differential Privacy Protected Preference Alignment on Survey Derived Data