Skip to content

Back to the catalog

A Zeroth-Order Paradigm for LLM Preference Alignment
arxiv.orgpaper

A Zeroth-Order Paradigm for LLM Preference Alignment

Proposes Comparison-based Preference Optimization (ComPO), a zeroth-order alternative to direct preference alignment methods (like DPO) that extracts directional information from preference pairs via comparison oracles rather than optimizing a differentiable preference loss, aimed at mitigating likelihood displacement. The paper establishes convergence guarantees for an offline scheme and a performance guarantee for an online variant using reverse-KL control against a reference policy, and reports experiments on Mistral, Llama, Gemma-2, Qwen3, and Gemma-3 showing improved length-controlled win rates over existing direct alignment baselines.

TL;DR A zeroth-order, comparison-oracle-based preference alignment method (ComPO) that improves on direct alignment methods and helps mitigate likelihood displacement.
Document

What it claims

ComPO is a zeroth-order preference-alignment method: instead of optimizing a differentiable preference loss (as DPO does), it uses comparison oracles to extract directional information from preference pairs, targeting the likelihood-displacement problem that arises when preference pairs have small likelihood margins. Beyond what the summary states, the abstract names the specific assumptions under which the guarantees hold — these are the actionable content of an abstract-only page.

How it works

Two schemes:

  • Offline ComPO: the basic comparison-oracle mechanism. Its convergence guarantee rests on three stated assumptions — smoothness, gradient sparsity, and compatibility between the oracle and a latent objective. The gradient-sparsity assumption is notable: zeroth-order methods generally scale badly with parameter dimension, and sparsity is the lever that makes the guarantee plausible for LLM-scale models.
  • Online ComPO: retains the offline comparison mechanism but adds unlabeled policy generations for reverse-KL control against a reference policy. Its performance guarantee holds under local coverage and in-distribution pairwise reward accuracy — i.e., the reference/coverage conditions typical of the coverage view of preference fine-tuning, not global assumptions.

Evidence

The page is abstract-only and reports no numbers. It states qualitatively: improvements over existing direct alignment methods including length-controlled win rates, across Mistral, Llama, Gemma-2, Qwen3, and Gemma-3; and pair-level diagnostics "consistent with mitigating likelihood displacement." No baselines, magnitudes, or benchmark names (e.g. AlpacaEval) are given on this page.

Limits

  • Abstract only — no quantitative results, no compute or training cost, no code or model release mentioned on the page. To judge whether the win-rate gains are material, you must open the PDF.
  • The guarantees are conditional on assumptions the authors themselves list (gradient sparsity in particular); whether those hold in your setting is not addressed by the abstract.
  • Online performance guarantee is for "a basic constrained scheme," suggesting the theory covers a simplified version, not necessarily the full method run in experiments.

If you are evaluating zeroth-order alternatives to DPO specifically to address likelihood displacement, this is worth the PDF read for the assumptions and diagnostics; the abstract alone does not establish the size of the gains.

Organisations named here

  • Mistral
  • Gemma-2

Technologies named here

  • Mistral
  • Llama
  • Gemma 2
  • Qwen3
  • Gemma 3

Techniques named here

  • Comparison-based Preference Optimization
  • Online ComPO
  • Direct preference alignment methods