Skip to content

KTO: Model Alignment as Prospect Theoretic Optimization

Feb 2024 · arXiv.org · Vol abs/2402.01306 · 195 citations · ⚡ 28 influential · 57 references
Computer Science

TL;DR

This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.

Abstract

Kahneman&Tversky's $\textit{prospect theory}$ tells us that humans perceive random variables in a biased but well-defined manner (1992); for example, humans are famously loss-averse. We show that objectives for aligning LLMs with human feedback implicitly incorporate many of these biases -- the success of these objectives (e.g., DPO) over cross-entropy minimization can partly be ascribed to them belonging to a family of loss functions that we call $\textit{human-aware losses}$ (HALOs). However, the utility functions these methods attribute to humans still differ from those in the prospect theory literature. Using a Kahneman-Tversky model of human utility, we propose a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, as current methods do. We call this approach KTO, and it matches or exceeds the performance of preference-based methods at scales from 1B to 30B, despite only learning from a binary signal of whether an output is desirable. More broadly, our work suggests that there is no one HALO that is universally superior; the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.

View source

Similar papers

#machine learning Preprint Sep 2026

Distortion of AI Alignment Revisited: RLHF is a Decent Utilitarian Aligner

This work presents a fine-grained analysis of the distortion of RLHF with reward clipping and demonstrates that such exponential degradation is not a fundamental property of the algorithm but rather a consequence of distribution mismatch between the distribution generating preference data and the KL reference policy.

Kazusato Oko, Annie Ulichney, Nika Haghtalab et al. · 3 citations · ⚡1
#artificial intelligence Preprint Oct 2026

Can You Trust Your Preference Models? Stackelberg Games for Alignment

Language models are frequently aligned to human preferences via imperfect evaluators whose errors can be exploited during optimization. We train policies to search for comparisons on which an evaluator may reverse the underlying preference, providing candidates for additional supervision. Since human preferences are un...

Riccardo Formenti, Aditya Agrawal, Vikas K. Garg · 0 citations
#small language model Preprint Aug 2026

Disentangling Optimization Scale from Preference Scale in DPO

This work shows that $\beta$ entangles two distinct roles: it governs the effective inverse preference-noise scale and simultaneously rescales the optimization dynamics, coupling this scale with the effective step size, and proposes a centered-softplus reformulation that is argmin-equivalent to DPO for $\beta>0$, while...

Ivan Kruzhilov · 0 citations
#artificial intelligence Preprint Sep 2026

A Zeroth-Order Paradigm for LLM Preference Alignment

This paper proposes and analyzes Comparison-based Preference Optimization (ComPO), a zeroth-order alignment method based on comparison oracles, and establishes a convergence guarantee for its basic offline scheme under smoothness, gradient sparsity, and compatibility between the oracle and a latent objective.

Peter Chen, Xi Chen, Wo-Tao Yin et al. · 0 citations
Preprint Oct 2026

What I Disbelieve: Quantifying Belief With Negative Ranking Functions

A challenge in exploring the psychology of human uncertainty is its measurement and quantification. Prior work has focused almost exclusively on probability, while the formal theories developed in philosophy are rarely tested. We tested Wolfgang Spohn's ranking theory, a normative account in which belief is graded by o...

Hanbin Go, Britt Anderson · 0 citations
#machine learning Preprint Sep 2026

Patterning in Practice: Debiasing Reward Models with Susceptibilities

This paper uses patterning, which reweights each preference pair according to its measured effect on posterior expectation values of benchmark losses (its susceptibility), to debias a Gemma 2 9B Instruct reward model trained on Skywork-Reward-Preference v0.2.

George Wang, Elizabeth Donoway, Daniel Murfet · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.