arXiv cs.AI· Tue M. Cao, Nguyen Do, My T. Thai·· 11 小时前AI 评分31
用语义最优传输实现 SAE 特征匹配与电路压缩
Semantic Optimal Transport for Sparse Autoencoder Feature Matching and Circuit Compression
AI 导读
研究者提出一种基于分布的语义距离框架,用激活加权分布而非单一解码向量表示 SAE 特征,并通过投影到共享参考空间后用 Wasserstein 距离比较,统一解决跨层特征匹配与特征电路压缩两个问题。该方法在实验中优于解码向量和基于 LLM 的基线,并能自动将大型特征电路压缩为可解释的超级节点。论文已被 Neurips 2026 接收。
正文 · 原文
Abstract:Sparse autoencoders (SAEs) have become a central tool for interpreting language models. However, two key SAE analyses that remain difficult to scale are (1) matching semantically similar features across multi-layers and (2) compressing large feature circuits into interpretable supernodes. Although these have been treated as separate problems, we show that both are instances of a more fundamental challenge, which we frame as the estimation of semantic distances between SAE features that lie on different activation manifolds. We introduce a distributional framework for this problem, in which each feature is represented not by a single decoder vector like in the literature, but by an activation-weighted distribution over the hidden states that express it. By projecting these distributions into a shared reference space and comparing them with Wasserstein distance, our method provides a unified semantic metric for cross-layer feature comparison. We prove that our representation is invariant to activation rescaling, stable under perturbations, and recovers true matches under finite-sample margin conditions. Empirically, our method outperforms decoder-vector and LLM-based baselines and captures subtle functional distinctions between related features. Notably, our method compresses large feature circuits into interpretable supernodes automatically.
| Comments: | Neurips 2026 |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2605.28567 [cs.LG] |
| (or arXiv:2605.28567v3 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.28567 arXiv-issued DOI via DataCite |
Submission history
From: Tue Minh Cao [view email]
[v1]
Wed, 27 May 2026 14:54:58 UTC (5,371 KB)
[v2]
Wed, 21 Oct 2026 19:48:02 UTC (5,381 KB)
[v3]
Fri, 30 Oct 2026 02:01:16 UTC (5,381 KB)
来源:arXiv cs.AI · arxiv.org