最新资讯
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 ·

面向大语言模型持续微调的未知预训练梯度估计与正交化

原文 我的收藏

该论文针对持续微调中灾难性遗忘问题,指出现有正交梯度投影方法因预训练数据与梯度未知而无法保护通用知识。作者提出 EoupCT:通过带 Gumbel-Softmax 松弛的可学习 soft prompt 动态生成最易被新任务遗忘的伪数据,以此估计预训练梯度;并将问题建模为多目标优化,引入一阶高效 Pareto 优化器联合优化 LLM 参数与 soft prompt,强制新任务更新与估计的预训练梯度正交。摘要称在多个 LLM 上的实验表明该方法能同时保持任务能力与通用知识,但未给出具体指标。

AI推荐理由 arXiv 新论文(v1,2026-09-25 提交),提出 EoupCT 框架,用可学习 soft prompt 配合 Gumbel-Softmax 生成易遗忘的伪数据来估计未知预训练梯度,并用一阶 Pareto 优化器在持续微调中强制新任务更新与估计梯度正交,以缓解灾难性遗忘。问题定义清晰、方法有具体机制,属于持续微调方向的可验证研究;但摘要仅给出实验结论性描述,未提供数据集、基线对比数值或代码,实际效果仍需全文验证,且尚未经同行评审。

72

正文

Computer Science > Computation and Language arXiv:2609.30935 (cs) [Submitted on 25 Sep 2026] Title:Estimating and Orthogonalizing Unknown Pre-training Gradients for Continual Fine-tuning of Large Language Models Authors:Bing Wang, Changchun Li, Xin-Qiang Cai, Lin Yuanbo Wu, Ximing Li, Gang Niu, Masashi Sugiyama View a PDF of the paper titled Estimating and Orthogonalizing Unknown Pre-training Gradients for Continual Fine-tuning of Large Language Models, by Bing Wang and 6 other authors View PDF HTML (experimental) Abstract:Continual fine-tuning is essential for large language models (LLMs) to dynamically adapt to real-world environments, yet it inevitably suffers from catastrophic forgetting, particularly the performance degradation of previous tasks and LLMs' general-purpose knowledge. Although existing methods, such as orthogonal gradient projection, mitigate the forgetting across various fine-tuning tasks, they fundamentally fail to preserve pre-training LLMs' inherent general-purpose knowledge because the original data and gradients of off-the-shelf pre-training LLMs required by these methods are strictly unknown and highly diverse. To bridge this critical gap, we propose EoupCT, a novel framework designed to Estimate and Orthogonalize Unknown Pre-training gradients for Continual LLM fine-Tuning. Specifically, EoupCT estimates pre-training gradients by dynamically generating pseudo data that is most susceptible to forgetting for new tasks through a learnable soft prompt equipped with Gumbel-Softmax relaxation. Furthermore, we formulate a multi-objective optimization problem and introduce a first-order efficient Pareto optimizer that jointly optimizes LLM parameters and the soft prompt, rigorously enforcing orthogonality between new task updates and the estimated pre-training gradients. Extensive experiments across multiple LLMs demonstrate that EoupCT effectively preserves both task-specific proficiency and inherent general-purpose knowledge, successfully mitigating the catastrophic forgetting. Comments: Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2609.30935 [cs.CL] (or arXiv:2609.30935v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2609.30935 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Bing Wang [view email] [v1] Fri, 25 Sep 2026 07:52:37 UTC (148 KB) Full-text links: Access Paper: View a PDF of the paper titled Estimating and Orthogonalizing Unknown Pre-training Gradients for Continual Fine-tuning of Large Language Models, by Bing Wang and 6 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.CL new | recent | 2026-09 Change to browse by: cs cs.AI cs.LG 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?) 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 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容