Autoregressive Direct Preference Optimization

[Submitted on 10 Feb 2026 (v1), last revised 10 Jun 2026 (this version, v2)]

View PDF HTML (experimental)

Abstract:Direct preference optimization (DPO) has emerged as a promising approach for aligning large language models (LLMs) with human preferences. However, the widespread reliance on the response-level Bradley-Terry (BT) model may limit its full potential, as the reference and learnable models are assumed to be autoregressive only after deriving the objective function. Motivated by this limitation, we revisit the theoretical foundations of DPO and propose a novel formulation that explicitly introduces the autoregressive assumption prior to applying the BT model. By reformulating and extending DPO, we derive a novel variant, termed Autoregressive DPO (ADPO), that explicitly integrates autoregressive modeling into the preference optimization framework. Without violating the theoretical foundations, the derived loss takes an elegant form: it shifts the summation operation in the DPO objective outside the log-sigmoid function. Furthermore, through theoretical analysis of ADPO, we show that there exist two length measures to be considered when designing DPO-based algorithms: the token length $mu$ and the feedback length $mu’$. To the best of our knowledge, we are the first to explicitly distinguish these two measures and analyze their implications for preference optimization in LLMs.

Submission history

From: Masanari Oi [view email]
[v1] Tue, 10 Feb 2026 08:45:30 UTC (1,968 KB)
[v2] Wed, 10 Jun 2026 06:12:57 UTC (1,968 KB)