最新资讯
stackoverflow.blog 欢迎来到芯片时代:半导体制造、AI 数据中心与芯片设计的未来 www.youtube.com AI Agent 总犯同样的错:CentralAgent AI 将记忆重构为经验系统 pub.towardsai.net Netflix 科学家建议重采样 LLM 评判:5 次仅将误差棒缩小 13% pub.towardsai.net Jev 作为 LLM 前的静默层:构建提示感知的模型路由器 reddit.com OpenAI 称 Astra 仅满足 10% 安全任务标准 dev.to FreeToken:在自有 GPU 上运行前沿 MoE 模型及其内存需求 dev.to 当 AI Agent 说“完成”时,究竟完成了什么? dev.to 部署 Underdog Bark 3.0 Pro:逐字转写、自定义后端与分块设置 dev.to 为艰难对话构建 AI:五个 Agent、一条安全正则与一位盲评监督者 techcrunch.com Palo Alto Networks 洽谈以 5 亿美元收购 AI Agent 安全初创公司 Clutch theinformation.com 黄仁勋被要求就涉华间谍指控向国会作简报 www.infoq.com Edera 推出 Object Capability Bounded Authority,试图将凭证与 AI Agent 工作负载隔离
多元动态
登录 注册
论文研究 arxiv.org ·

再探 AI 对齐的失真:RLHF 是一个像样的功利主义对齐器

原文 我的收藏

该论文对带奖励裁剪的 RLHF 失真做细粒度分析,证明此前 Gölz 等人(2025)观察到的随 Bradley-Terry 温度 β 指数级退化并非算法固有性质,而是偏好数据分布 μ 与 KL 参考策略 π_ref 之间分布不匹配的结果。作者在多种 KL 正则强度下给出紧致上下界:代表性情形下失真为 Θ̃(βB+β),B 为 μ 与 π_ref 对数密度比上界;当 μ=π_ref 时可达最优 O(β)。结论建议采用 on-policy 采样的偏好数据,或先在接近 μ 的数据上微调再执行 RLHF。

AI推荐理由 arXiv 论文(ICML2026 接收),作者给出 RLHF 失真的紧致上下界:在 Bradley-Terry 模型下失真为 Θ̃(βB+β),B 为偏好数据分布 μ 与 KL 参考策略 π_ref 的对数密度比上界;当 μ=π_ref 时失真降至 O(β)。结论指出指数级退化并非算法固有,而是分布不匹配所致,建议使用 on-policy 采样偏好数据或先微调。属理论分析,未提供实验验证,实际效果需进一步检验。

78

正文

Computer Science > Machine Learning arXiv:2609.12651 (cs) [Submitted on 11 Sep 2026] Title:Distortion of AI Alignment Revisited: RLHF is a Decent Utilitarian Aligner Authors:Kazusato Oko, Annie Ulichney, Nika Haghtalab, Han Bao View a PDF of the paper titled Distortion of AI Alignment Revisited: RLHF is a Decent Utilitarian Aligner, by Kazusato Oko and 3 other authors View PDF HTML (experimental) Abstract:While Reinforcement Learning from Human Feedback (RLHF) is the standard paradigm for aligning large language models with human preferences, its effectiveness in pluralistic settings has been called into question. Notably, recent work by Gölz et al. (2025) demonstrated that the \textit{distortion} -- defined as the multiplicative gap between the average user utility of the RLHF policy and the optimal average utility -- can scale exponentially with the Bradley-Terry temperature parameter $\beta$ when users have heterogeneous preferences. In this work, we present a fine-grained analysis of the distortion of RLHF with reward clipping and demonstrate that such exponential degradation is not a fundamental property of the algorithm but rather a consequence of distribution mismatch between the distribution generating preference data ($\mu$) and the KL reference policy ($\pi_{\mathrm{ref}}$). To this end, we establish tight upper and lower bounds on the distortion of RLHF across multiple regimes of the KL regularization strength. We show that in a representative regime, under the Bradley-Terry model, the distortion is $\tilde{\Theta}(\beta B + \beta)$, where $B$ is an upper bound on the log density ratio between $\mu$ and $\pi_{\mathrm{ref}}$. In particular, when there is no distribution mismatch (i.e., $\mu = \pi_{\mathrm{ref}}$), RLHF achieves the optimal distortion of $O(\beta)$ up to a constant. Our results suggest that, to reasonably maximize average utility with RLHF, it is preferable to use on-policy sampled preference data or to fine-tune before RLHF on data from a source close to $\mu$. Subjects: Machine Learning (cs.LG); Computer Science and Game Theory (cs.GT) Cite as: arXiv:2609.12651 [cs.LG] (or arXiv:2609.12651v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2609.12651 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Journal reference: ICML2026 Submission history From: Kazusato Oko [view email] [v1] Fri, 11 Sep 2026 09:55:06 UTC (608 KB) Full-text links: Access Paper: View a PDF of the paper titled Distortion of AI Alignment Revisited: RLHF is a Decent Utilitarian Aligner, by Kazusato Oko and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.LG new | recent | 2026-09 Change to browse by: cs cs.GT References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) IArxiv recommender toggle IArxiv Recommender (What is IArxiv?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

来源报道 · 1 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容