跳到正文
arXiv cs.AI· Alexandros Hollender, Sonja Kraiczy·· 3 小时前AI 评分42

基于损失训练下如何为 AI 对齐强制执行公理原则

Enforcing Axioms for AI Alignment under Loss-Based Rules

AI 导读

一篇 ICLR 2026 论文研究 RLHF 等基于损失的奖励模型训练何时能满足 Pareto 最优(PO)。论文将宪法式原则视为投票者,表示为嵌入空间中的线性方向,并证明多项式奖励模型和任意固定宽度 d≥2 的单隐层 ReLU MLP 奖励模型仍可能违反 PO;而在均匀比较方向和等长比较的理想化假设下,线性奖励的损失训练可恢复 PO,由此提出通过数据集设计恢复 PO 的思路。

正文 · 原文

View PDF HTML (experimental)

Abstract:Many alignment methods, most notably reinforcement learning from human feedback (RLHF), train reward models by minimizing a loss on pairwise comparisons of model responses. Inspired by principle-guided methods such as Constitutional AI, we treat each principle as a voter that compares responses according to that principle, for example, preferring the more helpful or less toxic response. We represent these voters as linear directions in a fixed embedding space, a simplifying assumption motivated by the Linear Representation Hypothesis. In this linear social choice model, Ge et al. (2024) showed that an optimal linear reward model can violate Pareto optimality (PO): From the principles-as-voters lens, this means a response A can be less helpful and more toxic than B, yet still receive a higher reward. We ask whether richer reward models or changes to comparison data can recover PO within loss-based training. We show that PO can still fail for polynomials of any fixed degree and one-hidden-layer ReLU multilayer perceptrons (MLPs) of any fixed width $ d\ge 2 $ with suitable finite parameter bounds. We then recover PO for loss-based training of linear rewards under suitable assumptions in an idealized setting with uniform comparison directions and equal comparison lengths. These results motivate dataset design as an approach to recovering PO in constitutional-style alignment while retaining loss-based training.
Comments: Published in the Proceedings of ICLR 2026
Subjects: Computer Science and Game Theory (cs.GT); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as: arXiv:2611.13369 [cs.GT]
  (or arXiv:2611.13369v1 [cs.GT] for this version)
  https://doi.org/10.48550/arXiv.2611.13369

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Sonja Kraiczy [view email]
[v1] Mon, 9 Nov 2026 23:44:36 UTC (39 KB)

来源:arXiv cs.AI · arxiv.org