最新资讯
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 工作负载隔离 wechat 这波杀疯了!旗舰级模型不限量、1个月视频额度免费领 bloomberg.com AI 抛售蔓延至信用市场,软银领跌亚洲美元债 dev.to 如何在专用 GPU 服务器上用 OpenAI 兼容 API 部署 LLM dev.to 审计 153 份 Claude Code 与 Codex 会话记录:User-Agent 与 URL 中的邮箱泄露
多元动态
登录 注册
大模型 arxiv.org ·

超越平均安全:机会约束的 LLM 微调

原文 我的收藏

该论文提出一种机会约束的安全保持微调框架,约束相对参考模型退化超过给定阈值的样本比例,而非仅控制平均安全损失。由于经验机会约束含不连续指示函数,作者引入违规率的可微 majorization 得到可处理的保守约束,并设计约束感知梯度下降,将 majorized 约束视为参数空间中的安全集,以闭式更新最小化修改微调方向,形成关注尾部风险的修正。在三个任务、三个模型的有害微调实验中,该方法称一致优于现有基线,作者认为 LLM 微调中的安全保持更适合建模为可靠性约束优化而非平均风险正则化。

AI推荐理由 arXiv 新论文(2026-09-24 提交),提出机会约束的 LLM 安全微调方法:限制相对参考模型退化超过阈值的样本比例,而非控制平均安全损失;用可微 majorization 近似不连续指示函数,并给出约束感知梯度下降的闭式更新。作者在三个任务、三个模型上做了有害微调实验,声称优于现有基线。局限:摘要未给出具体数据集、模型名和量化指标,效果需看全文验证。

78

正文

Computer Science > Machine Learning arXiv:2609.29960 (cs) [Submitted on 24 Sep 2026] Title:Beyond Average Safety: Chance-Constrained LLM Fine-tuning Authors:Taha Entesari, Mahyar Fazlyab View a PDF of the paper titled Beyond Average Safety: Chance-Constrained LLM Fine-tuning, by Taha Entesari and Mahyar Fazlyab View PDF HTML (experimental) Abstract:Fine-tuning large language models on new objectives can improve helpfulness, instruction following, or domain-specific performance, but it can also induce regressions on safety-critical prompts. Existing safety-preserving fine-tuning methods typically control average safety loss or use weighted auxiliary penalties, which can obscure rare but severe failures. We propose a chance-constrained formulation for safety-preserving fine-tuning that limits the fraction of safety examples whose degradation relative to a reference model exceeds a prescribed threshold. Because the resulting empirical chance constraint contains a discontinuous indicator, we introduce a differentiable majorization of the violation rate, yielding a tractable conservative constraint. We then develop a constraint-aware gradient descent method that treats the majorized constraint as a safe set in parameter space and minimally modifies the fine-tuning direction to preserve feasibility. The resulting update admits a closed form and produces a tail-aware safety correction that emphasizes examples near or above the degradation threshold. We conduct an extensive set of experiments on harmful fine-tuning across three different tasks and three models and show that our approach consistently outperforms the baselines that exist in the literature. These results suggest that safety preservation in LLM fine-tuning is better viewed as a reliability-constrained optimization problem than as average-risk regularization. Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI) Cite as: arXiv:2609.29960 [cs.LG] (or arXiv:2609.29960v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2609.29960 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Mahyar Fazlyab [view email] [v1] Thu, 24 Sep 2026 15:17:58 UTC (36 KB) Full-text links: Access Paper: View a PDF of the paper titled Beyond Average Safety: Chance-Constrained LLM Fine-tuning, by Taha Entesari and Mahyar Fazlyab View PDF HTML (experimental) TeX Source view license Current browse context: cs.LG new | recent | 2026-09 Change to browse by: cs cs.AI 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 篇 · 以下链接均前往原始媒体

aihot::arXiv - LLM 超越平均安全:机会约束的 LLM 微调 09-25 · 原文发布
← 返回精选动态 原文

更多内容