跳到正文
arXiv cs.AI· Marek Masiak, Andrzej Szablewski, Nicola Cancedda, Constantin Venhoff·· 3 小时前AI 评分48

TopKLoRA:可解释稀疏微调实现忠实回路发现

Interpretable sparse fine-tuning with TopKLoRA enables faithful circuit discovery

AI 导读

研究者提出可解释性设计优先的 LoRA 变体 TopKLoRA,每个 token 仅激活 k 个最大的 adapter 潜变量,且只用下游损失训练。

正文 · 原文

View PDF HTML (experimental)

Abstract:Fine-tuning on datasets of unknown origin can create a backdoor in the trained model when the data includes poisoned examples. Difficult to localise and remove, backdoors can persist through safety training. While parameter-efficient fine-tuning methods capture the full parameter changes introduced during training, they are not easily interpretable. We present the full method of TopKLoRA, extending the preliminary proposal of Masiak et al. (2025), an interpretable-by-design LoRA variant in which only the $k$ largest adapter latents are active at each token. Unlike SAEs, TopKLoRA is trained purely on downstream loss, where optimisation pressure incentivises learning functionally causal latents. We demonstrate this sparse LoRA adapter in a sleeper-agent backdoor case study where we create model organisms by fine-tuning gemma-2-2b, Qwen2.5-1.5B, and Qwen2.5-7B on a poisoned instruction-following dataset. For each organism, we identify and ablate a circuit that is both necessary and sufficient to implement the backdoor. Furthermore, our new fine-tuning method produces sparse circuits that are up to an order of magnitude smaller than a dense LoRA baseline, allowing surgical ablation of the malicious capability without sacrificing instruction-following performance. Finally, we propose a technique to construct model organisms with localised circuits using TopKLoRA latents and gradient-routing, which we use to validate the findings of our circuit search algorithm. We consider these findings as a step toward interpretable-by-design architectures that provide faithful units of analysis without compromising model performance. We share our code: this https URL.
Comments: 29 pages, 10 figures
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
Cite as: arXiv:2610.32866 [cs.LG]
  (or arXiv:2610.32866v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2610.32866

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Marek Masiak [view email]
[v1] Fri, 23 Oct 2026 16:37:29 UTC (149 KB)

来源:arXiv cs.AI · arxiv.org