跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 08:19 — 2026-11-18 08:19(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2606.26629

From Weights to Features: Sparse-Autoencoder-Guided Activation Regularization for Continual Learning in Large Language Models

Evan Ning, Wei Xue, Dong Lou, Yike Guo

原文摘要

Weight-protecting regularizers such as elastic weight consolidation (EWC) are a standard defense against catastrophic forgetting; however, in the sequential fine-tuning of large language models, they exhibit a stability-plasticity tradeoff that penalty tuning cannot resolve. We attribute this limitation in part to polysemanticity: because each weight participates in many unrelated concepts, a per-weight importance score has difficulty isolating the knowledge that requires protection. We instead regularize in activation space, using a pretrained sparse autoencoder (SAE) as a fixed dictionary of approximately monosemantic features. We formulate continual learning as constrained optimization over feature drift, with a stability constraint on the features to be preserved and a plasticity constraint on the features used by the current task, and we show that the resulting squared-hinge loss is a regularized Lagrangian relaxation of this problem, with EWC as a special case. A replay variant measures drift on 200 stored sequences per previous task, whereas a data-free variant stores only a 197 KB feature mask per task, versus 6.5 GB for EWC. On TRACE (Gemma-2 9B, Llama-3.1 8B) and MedCL (Gemma-2 9B), the replay variant matches or exceeds SAE-based feature distillation at approximately one third of its per-step cost, and the data-free variant attains the highest mean overall performance among methods that store no previous-task data and add no task-specific parameters. Task-relevant units are linearly separable in the SAE basis but not in the neuron basis (ROC-AUC of 0.87-0.88 versus 0.50), and weight-space protection constrains the features of other tasks nearly as strongly as those of the protected task.

cs.LG · cs.CL