跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21766 · v1

Margin Dynamics for Large Language Model Alignment

首次提交 2026-11-17 03:02
版本更新 2026-11-17 03:02
雷达观测 2026-11-18 19:44
arXiv ↗PDF ↗

摘要

Practitioners choose among LLM alignment methods largely by trial and error. We provide a theoretical foundation: each pairwise method defines a vector field on the probability simplex that governs how the model redistributes mass between preferred and dispreferred completions. Projecting onto a single preferred/dispreferred pair reduces this to a one-dimensional margin ODE with a closed-form solution. These solutions reveal that DPO margins grow without bound (logarithmically as O(log⁡t)O(\log t) in the gradient-flow limit) while IPO margins converge to a finite 1/(2τ)1/(2τ); that label noise induces a qualitative phase transition in DPO (unbounded →\to bounded) but affects IPO only quantitatively; and that gradient concentration under asymmetric weighting governs trainability at scale. We confirm all three predictions across five model families spanning four benchmarks. The closed-form solutions also enable principled method design: we prove that adding any label smoothing ε>0\varepsilon > 0 to SimPO creates a finite margin attractor at Δ∗=β−1log⁡((1−ε)/ε)Δ^* = β^{-1}\log((1-\varepsilon)/\varepsilon), while ε=0\varepsilon = 0 (standard SimPO) has no attractor. We test this across three models (8B-9B) and confirm the prediction: the theory-derived configuration (TPO-S, ε=0.05\varepsilon = 0.05) is competitive with the strongest baselines, attaining the highest mean IFEval score among the compared methods on all three, validating that the predicted finite attractor is a usable operating point rather than proposing a new state-of-the-art loss.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 03:02 · 最新观测版本

Margin Dynamics for Large Language Model Alignment

Practitioners choose among LLM alignment methods largely by trial and error. We provide a theoretical foundation: each pairwise method defines a vector field on the probability simplex that governs how the model redistributes mass between preferred and dispreferred completions. Projecting onto a single preferred/dispreferred pair reduces this to a one-dimensional margin ODE with a closed-form solution. These solutions reveal that DPO margins grow without bound (logarithmically as O(log⁡t)O(\log t) in the gradient-flow limit) while IPO margins converge to a finite 1/(2τ)1/(2τ); that label noise induces a qualitative phase transition in DPO (unbounded →\to bounded) but affects IPO only quantitatively; and that gradient concentration under asymmetric weighting governs trainability at scale. We confirm all three predictions across five model families spanning four benchmarks. The closed-form solutions also enable principled method design: we prove that adding any label smoothing ε>0\varepsilon > 0 to SimPO creates a finite margin attractor at Δ∗=β−1log⁡((1−ε)/ε)Δ^* = β^{-1}\log((1-\varepsilon)/\varepsilon), while ε=0\varepsilon = 0 (standard SimPO) has no attractor. We test this across three models (8B-9B) and confirm the prediction: the theory-derived configuration (TPO-S, ε=0.05\varepsilon = 0.05) is competitive with the strongest baselines, attaining the highest mean IFEval score among the compared methods on all three, validating that the predicted finite attractor is a usable operating point rather than proposing a new state-of-the-art loss.

查看此版本解读 →查看此版本原文 ↗