A Zeroth-Order Paradigm for LLM Preference Alignment
Peter Chen, Xi Chen, Wotao Yin, Tianyi Lin
University of California, Berkeley · New York University · DAMO Academy, Alibaba Group U.S. · Columbia University
Published September 16, 2026 · on the feed September 17, 2026 · ▲ 29 · arXiv 2609.19144
The abstract
Direct preference alignment methods are widely used to align large language models (LLMs) with human preferences because of their computational and memory efficiency. However, likelihood displacement motivates alternative ways to extract information from preference pairs with small likelihood margins. In this paper, we propose and analyze Comparison-based Preference Optimization (ComPO), a zeroth-order alignment method based on comparison oracles. ComPO extracts directional information from these pairs without directly optimizing a differentiable preference loss on them. We establish a convergence guarantee for its basic offline scheme under smoothness, gradient sparsity, and compatibility between the oracle and a latent objective. We further introduce online ComPO, which retains the offline comparison mechanism and uses unlabeled policy generations for reverse-KL control relative to a reference policy. Following the coverage perspective of preference fine-tuning, we establish a performance guarantee for a basic constrained scheme under local coverage and in-distribution pairwise reward accuracy. Experiments on Mistral, Llama, Gemma-2, Qwen3, and Gemma-3 models demonstrate improvements over existing direct alignment methods, including length-controlled win rates, with pair-level diagnostics providing evidence consistent with mitigating likelihood displacement.
The Brief
2:23A short podcast summary of the paper. Written and voiced by AI.
Transcript
A Zeroth-Order Paradigm for LLM Preference Alignment. By Peter Chen and three others, from the University of California, Berkeley, New York University, and two other institutions. Published on the sixteenth of September. No code repository is linked to it.
Direct preference alignment methods are widely used to align large language models with human preferences, because they are efficient in computation and memory. But they face a problem known as likelihood displacement, and it motivates other ways of drawing information from preference pairs whose likelihood margins are small. The question is how to learn from those pairs by a different route.
The authors propose and analyse Comparison-based Preference Optimization, ComPO. It is a zeroth-order alignment method built on comparison oracles. Instead of directly optimizing a differentiable preference loss on those pairs, it extracts directional information from them by comparison: learning which way to move without differentiating the loss. Zeroth-order is the technical name for that: an optimizer that works from evaluations and comparisons rather than from gradients.
There are two versions. The basic offline scheme comes with a convergence guarantee, which holds under three assumptions: smoothness, sparsity of the gradient, and compatibility between the oracle and a latent objective. Online ComPO keeps the same offline comparison mechanism, and adds unlabelled generations from the policy, used for reverse-KL control relative to a reference policy. The online version, in other words, is the same comparison idea with a leash: generations from the current policy, needing no labels, keep it from drifting too far from where it started.
Following the coverage perspective on preference fine-tuning, the authors also establish a performance guarantee for a basic constrained scheme. That one holds under local coverage, and under pairwise reward accuracy within the distribution.
Experiments span Mistral, Llama, Gemma-2, Qwen3, and Gemma-3 models, and show improvements over existing direct alignment methods, including on length-controlled win rates. Diagnostics at the level of individual pairs provide evidence consistent with mitigating likelihood displacement.
The shift is in what is asked of the difficult pairs. Rather than pushing a gradient through a loss on pairs where the margin is thin, ComPO asks only which direction a comparison favours, and the guarantees spell out under what conditions that is enough. The pair-level diagnostics are described with care: consistent with mitigating the problem, not proof that it is gone.
Paper Quest · 7 chapters · about 40 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Some preference pairs are almost ties, and a standard loss turns them into trouble. That is the wall.
You align a language model with human preference pairs using a direct method. It is cheap, but on pairs whose two answers the model scores almost equally, training can misbehave.
The road ahead
- 1 · The problem ~6 min Direct alignment is cheap, but on pairs whose two answers the model scores almost equally, it can push down the very answer people preferred.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min Use hard pairs only to judge whether small random nudges to the model help, then add up those verdicts into an update.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Pick small-margin pairs, nudge the model randomly, judge each nudge on the pairs, sum the verdicts into a step, and keep drift in check.
- 6 · The experiment ~6 min You’ll guess: Compared with existing direct alignment methods, how did ComPO fare on length-controlled win rates?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.