A Zeroth-Order Paradigm for LLM Preference Alignment
Summary
The paper proposes Comparison-based Preference Optimization (ComPO), a zeroth-order alignment method for LLMs that uses comparison oracles to avoid likelihood displacement. It includes theoretical guarantees and experimental improvements over existing methods.
View Cached Full Text
Cached at: 09/17/26, 06:54 AM
Paper page - A Zeroth-Order Paradigm for LLM Preference Alignment
Source: https://huggingface.co/papers/2609.19144
Abstract
Directpreferencealignmentmethodsarewidelyusedtoalignlargelanguagemodels(LLMs)withhumanpreferencesbecauseoftheircomputationalandmemoryefficiency.However,likelihooddisplacementmotivatesalternativewaystoextractinformationfrompreferencepairswithsmalllikelihoodmargins.Inthispaper,weproposeandanalyzeComparison-basedPreferenceOptimization(ComPO),azeroth-orderalignmentmethodbasedoncomparisonoracles.ComPOextractsdirectionalinformationfromthesepairswithoutdirectlyoptimizingadifferentiablepreferencelossonthem.Weestablishaconvergenceguaranteeforitsbasicofflineschemeundersmoothness,gradientsparsity,andcompatibilitybetweentheoracleandalatentobjective.WefurtherintroduceonlineComPO,whichretainstheofflinecomparisonmechanismandusesunlabeledpolicygenerationsforreverse-KLcontrolrelativetoareferencepolicy.Followingthecoverageperspectiveofpreferencefine-tuning,weestablishaperformanceguaranteeforabasicconstrainedschemeunderlocalcoverageandin-distributionpairwiserewardaccuracy.ExperimentsonMistral,Llama,Gemma-2,Qwen3,andGemma-3modelsdemonstrateimprovementsoverexistingdirectalignmentmethods,includinglength-controlledwinrates,withpair-leveldiagnosticsprovidingevidenceconsistentwithmitigatinglikelihooddisplacement.
View arXiv pageView PDFAdd to collection
Get this paper in your agent:
hf papers read 2609\.19144
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2609.19144 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2609.19144 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2609.19144 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Distributionally Robust Listwise Preference Optimization
This paper proposes a distributionally robust listwise preference optimization method for LLM alignment that handles ranking-label uncertainty, with a tractable objective and strong convergence guarantees.
Aligned but Fragile: Enhancing LLM Safety Robustness via Zeroth-Order Optimization
This paper proposes a hybrid framework combining first-order safety alignment with zeroth-order refinement to enhance the robustness of LLM safety alignment against post-alignment perturbations. Theoretical and empirical results show that only a few refinement steps can improve robustness while preserving safety.
StoicLLM: Preference Optimization for Philosophical Alignment in Small Language Models
This research paper investigates using preference optimization (ORPO, AlphaPO) on small language models like Llama-3.2-3B and Qwen-3-4B to align them with Stoic philosophy using micro-datasets. The study finds that while 300 examples can effectively encode Stoic virtues, small models still struggle with outward-facing cosmopolitan duties.
RLearner-LLM: Balancing Logical Grounding and Fluency in Large Language Models via Hybrid Direct Preference Optimization
This paper introduces RLearner-LLM, a framework using Hybrid-DPO to balance logical correctness and fluency in LLM-generated explanations, achieving significant NLI entailment improvements across multiple domains and base models while mitigating the verbosity bias of standard preference signals.
Which Pairs to Compare for LLM Post-Training?
This paper studies the problem of selecting which completion pairs to label for human preference feedback in LLM post-training. It formulates comparison curation as a sampling-design problem, provides theoretical bounds on DPO's policy optimality gap, and proposes practical sampling designs that improve sample efficiency over common heuristics on synthetic and real benchmarks.