Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization
On the map: LLM alignment / RLHF / preference optimisation → LLM preference optimization methods
Abstract (arXiv)
Language model alignment methods such as reinforcement learning from human feedback (RLHF) have led to impressive advances in language model capabilities, but are limited by a widely observed phenomenon known as overoptimization, where the quality of the language model degrades over the course of the alignment process. As the model optimizes performance with respect to an offline reward model, it overfits to inaccuracies and drifts away from preferred responses covered by the data. To discourage such distribution shift, KL-regularization is widely employed in existing offline alignment methods, but overoptimization continues to harm performance. Lending theoretical insight into the source of these empirical observations, we first show that the KL-regularization is too weak to prevent overfitting, then raise the following question: is it possible to design an efficient algorithm that is provably robust to overoptimization? We address this question with a new algorithm for offline alignment, chi2-Preference Optimization (chiPO). chiPO is a one-line change to Direct Preference Optimization (DPO; Rafailov et al., 2023), which only involves modifying the logarithmic link function in the DPO objective. Despite this minimal change, chiPO implicitly implements the principle of pessimism in the face of uncertainty via regularization with the chi2-divergence -- which quantifies uncertainty more effectively than KL-regularization -- and provably alleviates overoptimization, achieving sample-complexity guarantees based on single-policy concentrability -- the gold standard in offline reinforcement learning. chiPO's simplicity and strong guarantees make it the first practical and general-purpose offline alignment algorithm that is provably robust to overoptimization.
Key facts. Cited by 78 papers in the map (data through 7 Oct 2026). Placed in LLM preference optimization methods, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 48 of its 103 references that are in the map. First posted on arXiv 18 Jul 2024.
Builds on
48 of 103 references.
Closest ancestors · 9
Same direction, newest first
- 2024Self-Play with Adversarial Critic: Provable and Scalable Offline Alignment for Language Models6 Jun
- 2024The Importance of Online Data: Understanding Preference Fine-tuning via Coverage3 Jun
- 2024Robust Preference Optimization through Reward Model Distillation29 May
- 2024From r to Q^*: Your Language Model is Secretly a Q-Function18 Apr
- 2024Smaug: Fixing Failure Modes of Preference Optimisation with DPO-Positive20 Feb
- 2024Generalized Preference Optimization: A Unified Approach to Offline Alignment8 Feb
- 2024Direct Language Model Alignment from Online AI Feedback7 Feb
- 2023Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraints28 Sep
- 2023Statistical Rejection Sampling Improves Preference Optimization13 Sep
Other references · 39
- 2023GPT-4 Technical Reportcited by 18,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,634
- 2023PaLM 2 Technical Reportcited by 1,154
- 2023RAFT: Reward rAnked FineTuning for Generative Foundation Model Alignmentcited by 672
- 2024Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Modelscited by 552
- 2023Iterative Preference Learning from Human Feedback: Bridging Theory and Practice for RLHF under KL-Constraintcited by 346
- 2024RLHF Workflow: From Reward Modeling to Online RLHFcited by 265
- 2024Self-Play Preference Optimization for Language Model Alignmentcited by 228
- 2023Reward Model Ensembles Help Mitigate Overoptimizationcited by 225
- 2023Nash Learning from Human Feedbackcited by 220
- 2023Helping or Herding? Reward Model Ensembles Mitigate but do not Eliminate Reward Hackingcited by 195
27 more
- 2024Advancing LLM Reasoning Generalists with Preference Treescited by 191
- 2024Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Datacited by 184
- 2024Direct Nash Optimization: Teaching Language Models to Self-Improve with General Preferencescited by 176
- 2021Pessimistic Model-based Offline Reinforcement Learning under Partial Coveragecited by 160
- 2022Hybrid RL: Using Both Offline and Online Data Can Make RL Efficientcited by 158
- 2024A Minimaximalist Approach to Reinforcement Learning from Human Feedbackcited by 141
- 2024Scaling Laws for Reward Model Overoptimization in Direct Alignment Algorithmscited by 139
- 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
- 2021Dueling RL: Reinforcement Learning with Trajectory Preferencescited by 105
- 2023Is RLHF More Difficult than Standard RL?cited by 96
- 2023Confronting Reward Model Overoptimization with Constrained RLHFcited by 96
- 2024Value-Incentivized Preference Optimization: A Unified Approach to Online and Offline RLHFcited by 73
- 2023Reinforcement Learning with Human Feedback: Learning Dynamic Choices via Pessimismcited by 69
- 2024REBEL: Reinforcement Learning via Regressing Relative Rewardscited by 66
- 2024Active Preference Optimization for Sample Efficient RLHFcited by 61
- 2024Iterative Data Smoothing: Mitigating Reward Overfitting and Overoptimization in RLHFcited by 57
- 2024Online Iterative Reinforcement Learning from Human Feedback with General Preference Modelcited by 52
- 2023Making RL with Preference-based Feedback Efficient via Randomizationcited by 46
- 2022Versatile Offline Imitation from Observations and Examples via Regularized State-Occupancy Matchingcited by 43
- 2024Dataset Reset Policy Optimization for RLHFcited by 41
- 2020Understanding Learned Reward Functionscited by 37
- 2023Foundations of Reinforcement Learning and Interactive Decision Makingcited by 33
- 2024Overcoming Reward Overoptimization via Adversarial Policy Optimization with Lightweight Uncertainty Estimationcited by 33
- 2023Provable Reward-Agnostic Preference-Based Reinforcement Learningcited by 25
- 2024Exploration-Driven Policy Optimization in RLHF: Theoretical Insights on Efficient Data Utilizationcited by 25
- 2024Countering Reward Over-optimization in LLM with Demonstration-Guided Reinforcement Learningcited by 20
Built on by
Citing papers per year: 2024: 6; 2025: 41; 2026: 31.
78 papers.
Sort:
By area:
- 2025Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignmentcited by 91
- 2025Scaling Test-Time Compute Without Verification or RL is Suboptimalcited by 82
- 2024Unintentional Unalignment: Likelihood Displacement in Direct Preference Optimizationcited by 66
- 2025All Roads Lead to Likelihood: The Value of Reinforcement Learning in Fine-Tuningcited by 58
- 2025A Survey of Direct Preference Optimizationcited by 35
- 2024Sharp Analysis for KL-Regularized Contextual Bandits and RLHFcited by 32
- 2025Inference-Time Reward Hacking in Large Language Modelscited by 32
- 2025On a few pitfalls in KL divergence gradient estimation for RLcited by 27
- 2025Accelerating RL for LLM Reasoning with Optimal Advantage Regressioncited by 23
- 2025Logarithmic Regret for Online KL-Regularized Reinforcement Learningcited by 20
- 2025Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?cited by 20
- 2025Robust LLM Alignment via Distributionally Robust Direct Preference Optimizationcited by 17
38 more
- 2025Extragradient Preference Optimization (EGPO): Beyond Last-Iterate Convergence for Nash Learning from Human Feedbackcited by 15
- 2026Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewardscited by 15
- 2025SpatialThinker: Reinforcing Scene Graph-Grounded Spatial Reasoning via Dense Rewardscited by 14
- 2024Sail into the Headwind: Alignment via Robust Rewards and Dynamic Labels against Reward Hackingcited by 13
- 2025KL-Regularized RLHF with Multiple Reference Models: Exact Solutions and Sample Complexitycited by 11
- 2026Future-KL Regularized GRPO: Process-Level Credit Assignment from f-Divergence Regularizationcited by 11
- 2024Forward KL Regularized Preference Optimization for Aligning Diffusion Policiescited by 10
- 2025Offline Reinforcement Learning in Large State Spaces: Algorithms and Guaranteescited by 10
- 2024Faster WIND: Accelerating Iterative Best-of-N Distillation for LLM Alignmentcited by 9
- 2025Towards a Sharp Analysis of Offline Policy Learning for f-Divergence-Regularized Contextual Banditscited by 9
- 2025Preference Optimization by Estimating the Ratio of the Data Distributioncited by 9
- 2025A Unified Theoretical Analysis of Private and Robust Offline Alignment: from RLHF to DPOcited by 8
- 2025Mitigating Preference Hacking in Policy Optimization with Pessimismcited by 7
- 2025Diffusion-SDPO: Safeguarded Direct Preference Optimization for Diffusion Modelscited by 6
- 2025RSPO: Regularized Self-Play Alignment of Large Language Modelscited by 5
- 2025Learning a Pessimistic Reward Model in RLHFcited by 5
- 2025Information-Theoretic Reward Modeling for Stable RLHF: Detecting and Mitigating Reward Hackingcited by 5
- 2026Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferencescited by 5
- 2025Design Considerations in Offline Preference-based RLcited by 4
- 2025Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspectivecited by 4
- 2025RePO: Understanding Preference Learning Through ReLU-Based Optimizationcited by 4
- 2025PPO in the Fisher-Rao geometrycited by 4
- 2025Preference learning made easy: Everything should be understood through win ratecited by 3
- 2025SquarechiPO: Differentially Private and Robust chi2-Preference Optimization in Offline Direct Alignmentcited by 3
- 2025Beyond RLHF: A Unified Theoretical Framework of Alignmentcited by 3
- 2025Offline and Online KL-Regularized RLHF under Differential Privacycited by 3
- 2025Improved Bounds for Private and Robust Alignmentcited by 3
- 2026f-Trajectory Balance: A Loss Family for Tuning GFlowNets, Generative Models, and LLMs with Off- and On-Policy Datacited by 3
- 2024Meta-Learning Objectives for Preference Optimizationcited by 2
- 2025C2-DPO: Constrained Controlled Direct Preference Optimizationcited by 2
- 2025Mix- and MoE-DPO: A Variational Inference Approach to Direct Preference Optimizationcited by 2
- 2025Non-Asymptotic Global Convergence of PPO-Clipcited by 2
- 2025Semiparametric Preference Optimization: Your Language Model is Secretly a Single-Index Modelcited by 2
- 2026Direct Preference Optimization with Rating Information: Practical Algorithms and Provable Gainscited by 2
- 2026Semantic-aware Wasserstein Policy Regularization for Large Language Model Alignmentcited by 2
- 2026Best-of-Tails: Bridging Optimism and Pessimism in Inference-Time Alignmentcited by 2
- 2026Robust Optimization for Mitigating Reward Hacking with Correlated Proxiescited by 2
- 2026f-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analysescited by 2
50 most cited of 78 All 78 (JSON)
- 2026Asynchronous LLM Post-Training: Group-Mass Capping and Convergence Analysis1 Oct 2026
- 2026Distortion of AI Alignment Revisited: RLHF is a Decent Utilitarian Aligner11 Sep 2026
- 2026Manifold Drift in Flow Preference Optimization: A Root Cause of Reward Hacking20 Aug 2026
- 2026Towards a theory of inference-time alignment with unknown rewards15 Aug 2026
- 2026When Does Online Imitation Learning Help in LLM Post-Training? The Role of (Non-)Realizability Beyond Horizon29 Jun 2026
- 2026Normalized Rewards for Preference Optimization26 Jun 2026
- 2026A Markov Chain Approach to Preference Alignment21 Jun 2026
- 2026Read the Trace, Steer the Path: Trajectory-Aware Reinforcement Learning for Diffusion Language Models3 Jun 2026
- 2026Efficient Exploration for Iterative Nash Preference Optimization31 May 2026
- 2026LARK: Learnability-Grounded Trajectory Selection for Efficient Reasoning Distillation28 May 2026
- 2026How Neural Reward Models Learn Features for Policy Optimization: A Single-Index Analysis23 May 2026
- 2026f-Trajectory Balance: A Loss Family for Tuning GFlowNets, Generative Models, and LLMs with Off- and On-Policy Data14 May 2026
38 more
- 2026Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability9 May 2026
- 2026f-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses7 May 2026
- 2026Beyond Negative Rollouts: Positive-Only Policy Optimization with Implicit Negative Gradients7 May 2026
- 2026OGPO: Sample Efficient Full-Finetuning of Generative Control Policies4 May 2026
- 2026Robust Optimization for Mitigating Reward Hacking with Correlated Proxies13 Apr 2026
- 2026Tail-Aware Information-Theoretic Bounds for LLM Alignment under Heavy-Tailed Rewards12 Apr 2026
- 2026Best-of-Tails: Bridging Optimism and Pessimism in Inference-Time Alignment6 Mar 2026
- 2026Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences26 Feb 2026
- 2026Learnable Chernoff Baselines for Inference-Time Alignment8 Feb 2026
- 2026Displacement-Resistant Extensions of DPO with Nonconvex f-Divergences6 Feb 2026
- 2026Provably avoiding over-optimization in Direct Preference Optimization without knowing the data distribution5 Feb 2026
- 2026Approximation of Log-Partition Function in Policy Mirror Descent Induces Implicit Regularization for LLM Post-Training5 Feb 2026
- 2026Semantic-aware Wasserstein Policy Regularization for Large Language Model Alignment2 Feb 2026
- 2026Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewards2 Feb 2026
- 2026Your Self-Play Algorithm is Secretly an Adversarial Imitator: Understanding LLM Self-Play through the Lens of Imitation Learning1 Feb 2026
- 2026Direct Preference Optimization with Rating Information: Practical Algorithms and Provable Gains31 Jan 2026
- 2026Latent Adversarial Regularization for Offline Preference Optimization29 Jan 2026
- 2026Principled Fine-tuning of LLMs from User-Edits: A Medley of Preference, Supervision, and Reward27 Jan 2026
- 2026Future-KL Regularized GRPO: Process-Level Credit Assignment from f-Divergence Regularization15 Jan 2026
- 2025Improved Bounds for Private and Robust Alignment29 Dec 2025
- 2025Semiparametric Preference Optimization: Your Language Model is Secretly a Single-Index Model26 Dec 2025
- 2025Non-Asymptotic Global Convergence of PPO-Clip18 Dec 2025
- 2025SpatialThinker: Reinforcing Scene Graph-Grounded Spatial Reasoning via Dense Rewards10 Nov 2025
- 2025Diffusion-SDPO: Safeguarded Direct Preference Optimization for Diffusion Models5 Nov 2025
- 2025Information-Theoretic Reward Modeling for Stable RLHF: Detecting and Mitigating Reward Hacking15 Oct 2025
- 2025Offline and Online KL-Regularized RLHF under Differential Privacy15 Oct 2025
- 2025Mix- and MoE-DPO: A Variational Inference Approach to Direct Preference Optimization9 Oct 2025
- 2025Provably Mitigating Corruption, Overoptimization, and Verbosity Simultaneously in Offline and Online RLHF/DPO Alignment7 Oct 2025
- 2025Offline Reinforcement Learning in Large State Spaces: Algorithms and Guarantees5 Oct 2025
- 2025Failure Modes of Maximum Entropy RLHF24 Sep 2025
- 2025Online Distributionally Robust LLM Alignment via Regression to Relative Reward23 Sep 2025
- 2025Symmetric Behavior Regularized Policy Optimization6 Aug 2025
- 2025DPO Unchained: Your Training Algorithm is Secretly Disentangled in Human Choice Theory (and its Loss' Convexity is Dispensable)10 Jul 2025
- 2025Inference-Time Reward Hacking in Large Language Models24 Jun 2025
- 2025On a few pitfalls in KL divergence gradient estimation for RL11 Jun 2025
- 2025Mitigating Reward Over-optimization in Direct Alignment Algorithms with Importance Sampling10 Jun 2025
- 2025PPO in the Fisher-Rao geometry4 Jun 2025
- 2025Beyond RLHF: A Unified Theoretical Framework of Alignment2 Jun 2025
50 newest of 78 All 78 (JSON)
- 2025Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignmentcited by 91
- 2024Unintentional Unalignment: Likelihood Displacement in Direct Preference Optimizationcited by 66
- 2025A Survey of Direct Preference Optimizationcited by 35
- 2024Sharp Analysis for KL-Regularized Contextual Bandits and RLHFcited by 32
- 2025Inference-Time Reward Hacking in Large Language Modelscited by 32
- 2025Logarithmic Regret for Online KL-Regularized Reinforcement Learningcited by 20
- 2025Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?cited by 20
- 2025Robust LLM Alignment via Distributionally Robust Direct Preference Optimizationcited by 17
- 2025Extragradient Preference Optimization (EGPO): Beyond Last-Iterate Convergence for Nash Learning from Human Feedbackcited by 15
- 2024Sail into the Headwind: Alignment via Robust Rewards and Dynamic Labels against Reward Hackingcited by 13
- 2025KL-Regularized RLHF with Multiple Reference Models: Exact Solutions and Sample Complexitycited by 11
- 2024Faster WIND: Accelerating Iterative Best-of-N Distillation for LLM Alignmentcited by 9
12 most cited of 50 All 50 (JSON)
- 2026Distortion of AI Alignment Revisited: RLHF is a Decent Utilitarian Aligner11 Sep 2026
- 2026Towards a theory of inference-time alignment with unknown rewards15 Aug 2026
- 2026Normalized Rewards for Preference Optimization26 Jun 2026
- 2026A Markov Chain Approach to Preference Alignment21 Jun 2026
- 2026Efficient Exploration for Iterative Nash Preference Optimization31 May 2026
- 2026How Neural Reward Models Learn Features for Policy Optimization: A Single-Index Analysis23 May 2026
- 2026f-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses7 May 2026
- 2026Robust Optimization for Mitigating Reward Hacking with Correlated Proxies13 Apr 2026
- 2026Tail-Aware Information-Theoretic Bounds for LLM Alignment under Heavy-Tailed Rewards12 Apr 2026
- 2026Best-of-Tails: Bridging Optimism and Pessimism in Inference-Time Alignment6 Mar 2026
- 2026Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences26 Feb 2026
- 2026Displacement-Resistant Extensions of DPO with Nonconvex f-Divergences6 Feb 2026
12 newest of 50 All 50 (JSON)
- 2025Scaling Test-Time Compute Without Verification or RL is Suboptimalcited by 82
- 2025Accelerating RL for LLM Reasoning with Optimal Advantage Regressioncited by 23
- 2025SpatialThinker: Reinforcing Scene Graph-Grounded Spatial Reasoning via Dense Rewardscited by 14
- 2026Future-KL Regularized GRPO: Process-Level Credit Assignment from f-Divergence Regularizationcited by 11
- 2026Beyond Negative Rollouts: Positive-Only Policy Optimization with Implicit Negative Gradientscited by 1
- 2026LARK: Learnability-Grounded Trajectory Selection for Efficient Reasoning Distillationcited by 1
- 2026Asynchronous LLM Post-Training: Group-Mass Capping and Convergence Analysiscited by 0
- 2026Asynchronous LLM Post-Training: Group-Mass Capping and Convergence Analysis1 Oct 2026
- 2026LARK: Learnability-Grounded Trajectory Selection for Efficient Reasoning Distillation28 May 2026
- 2026Beyond Negative Rollouts: Positive-Only Policy Optimization with Implicit Negative Gradients7 May 2026
- 2026Future-KL Regularized GRPO: Process-Level Credit Assignment from f-Divergence Regularization15 Jan 2026
- 2025SpatialThinker: Reinforcing Scene Graph-Grounded Spatial Reasoning via Dense Rewards10 Nov 2025
- 2025Accelerating RL for LLM Reasoning with Optimal Advantage Regression27 May 2025
- 2025Scaling Test-Time Compute Without Verification or RL is Suboptimal17 Feb 2025
- 2024Forward KL Regularized Preference Optimization for Aligning Diffusion Policiescited by 10
- 2025Diffusion-SDPO: Safeguarded Direct Preference Optimization for Diffusion Modelscited by 6
- 2026Read the Trace, Steer the Path: Trajectory-Aware Reinforcement Learning for Diffusion Language Modelscited by 0
- 2026Manifold Drift in Flow Preference Optimization: A Root Cause of Reward Hackingcited by 0
- 2026Manifold Drift in Flow Preference Optimization: A Root Cause of Reward Hacking20 Aug 2026
- 2026Read the Trace, Steer the Path: Trajectory-Aware Reinforcement Learning for Diffusion Language Models3 Jun 2026
- 2025Diffusion-SDPO: Safeguarded Direct Preference Optimization for Diffusion Models5 Nov 2025
- 2024Forward KL Regularized Preference Optimization for Aligning Diffusion Policies9 Sep 2024
- 2025Offline Reinforcement Learning in Large State Spaces: Algorithms and Guaranteescited by 10
- 2025Towards a Sharp Analysis of Offline Policy Learning for f-Divergence-Regularized Contextual Banditscited by 9
- 2026When Does Online Imitation Learning Help in LLM Post-Training? The Role of (Non-)Realizability Beyond Horizoncited by 2
- 2025Symmetric Behavior Regularized Policy Optimizationcited by 0
- 2026When Does Online Imitation Learning Help in LLM Post-Training? The Role of (Non-)Realizability Beyond Horizon29 Jun 2026
- 2025Offline Reinforcement Learning in Large State Spaces: Algorithms and Guarantees5 Oct 2025
- 2025Symmetric Behavior Regularized Policy Optimization6 Aug 2025
- 2025Towards a Sharp Analysis of Offline Policy Learning for f-Divergence-Regularized Contextual Bandits9 Feb 2025
- 2025All Roads Lead to Likelihood: The Value of Reinforcement Learning in Fine-Tuningcited by 58
- 2025On a few pitfalls in KL divergence gradient estimation for RLcited by 27
- 2026Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewardscited by 15
- 2025PPO in the Fisher-Rao geometrycited by 4
- 2025Preference learning made easy: Everything should be understood through win ratecited by 3
- 2026f-Trajectory Balance: A Loss Family for Tuning GFlowNets, Generative Models, and LLMs with Off- and On-Policy Datacited by 3
- 2025Non-Asymptotic Global Convergence of PPO-Clipcited by 2
- 2026OGPO: Sample Efficient Full-Finetuning of Generative Control Policiescited by 1
- 2026Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrabilitycited by 1
- 2026Principled Fine-tuning of LLMs from User-Edits: A Medley of Preference, Supervision, and Rewardcited by 0
- 2026Approximation of Log-Partition Function in Policy Mirror Descent Induces Implicit Regularization for LLM Post-Trainingcited by 0
- 2026Learnable Chernoff Baselines for Inference-Time Alignmentcited by 0
- 2026f-Trajectory Balance: A Loss Family for Tuning GFlowNets, Generative Models, and LLMs with Off- and On-Policy Data14 May 2026
- 2026Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability9 May 2026
- 2026OGPO: Sample Efficient Full-Finetuning of Generative Control Policies4 May 2026
- 2026Learnable Chernoff Baselines for Inference-Time Alignment8 Feb 2026
- 2026Approximation of Log-Partition Function in Policy Mirror Descent Induces Implicit Regularization for LLM Post-Training5 Feb 2026
- 2026Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewards2 Feb 2026
- 2026Principled Fine-tuning of LLMs from User-Edits: A Medley of Preference, Supervision, and Reward27 Jan 2026
- 2025Non-Asymptotic Global Convergence of PPO-Clip18 Dec 2025
- 2025On a few pitfalls in KL divergence gradient estimation for RL11 Jun 2025
- 2025PPO in the Fisher-Rao geometry4 Jun 2025
- 2025All Roads Lead to Likelihood: The Value of Reinforcement Learning in Fine-Tuning3 Mar 2025
- 2025Preference learning made easy: Everything should be understood through win rate14 Feb 2025
Similar, not cited
Close in wording, no citation either way
- 2026Theoretical Limits of Language Model Alignment
- 2024Decoding-time Realignment of Language Models
- 2026From RLHF to Direct Alignment: A Theoretical Unification of Preference Learning for Large Language Models
- 2025Doubly Robust Alignment for Large Language Models
- 2024Towards Efficient Exact Optimization of Language Model Alignment
- 2024On the Algorithmic Bias of Aligning Large Language Models with RLHF: Preference Collapse and Matching Regularization
- 2025AlignDistil: Token-Level Language Model Alignment as Adaptive Policy Distillation
- 2024Asymptotics of Language Model Alignment