跳到正文
arXiv cs.CL· Bryce Grant, Peng Wang·· 11 小时前AI 评分31

用层论分解 Transformer 表征:把局部上下文粘合成全局语义

Gluing Local Contexts into Global Meaning: A Sheaf-Theoretic Decomposition of Transformer Representations

AI 导读

研究者提出用层论(sheaf)在释义图上构建胞腔层,无需训练即可通过 Laplacian 得到内容子空间,仅 20 维核在 8 个模型的 CounterFact 事实检索上平均超过 LEACE 全维子空间 17.1 个百分点,联合约束同一事实的所有释义再提升 6.5 个百分点。

正文 · 原文

View PDF HTML (experimental)

Abstract:Prior research into interpretability does not test whether a representation stays consistent under paraphrasing. Each pair of paraphrases can be thought of as a local witness that two activations should be the same. From these local witnesses we can build a cellular sheaf on the paraphrase graph. The question of what is consistent under paraphrasing can be answered by the Laplacian $L_\mathcal{F}$ given a frozen model. No training required. Our kernel $H^0$ gives us a content subspace. We show that with only 20 dims the kernel outperforms the subspace that LEACE retains with all dims on held-out CounterFact fact retrieval by $+17.1$\,pp on average across 8 models. By constraining all paraphrases of a fact together we see an additional increase of $+6.5$\,pp. Our spectral complement shows us where the causal influence is concentrated. Ablating the coordinates that vary the most when paraphrased (which approximates ablating the spectral complement at the coordinate level) leads to $5.6$ to $26.5\times$ larger changes in model outputs compared to ablating coordinates with matched per-coordinate variability. We find this across 9 models from 124M to 13B params. By stacking layers we can create a grid which has $b_1 = N(L-1)$ algebraic 1-cycles. The harmonic mass derived from the model varies by nearly 3 orders of magnitude between the 6 architectures. It also tracks the order of steering fragility (Spearman's $\rho = 0.90$, exact one-sided permutation $p = 0.014$). The kernel, its spectral complement and the harmonic mass all come from the same paraphrase graph. Project page: this https URL.
Comments: NeurIPS 2026 Poster, ICLR Unifying Concept Representation Learning
Subjects: Computation and Language (cs.CL); Machine Learning (cs.LG)
Cite as: arXiv:2610.17117 [cs.CL]
  (or arXiv:2610.17117v2 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2610.17117

arXiv-issued DOI via DataCite

Submission history

From: Bryce Grant [view email]
[v1] Mon, 12 Oct 2026 17:10:02 UTC (317 KB)
[v2] Fri, 30 Oct 2026 17:27:35 UTC (312 KB)

来源:arXiv cs.CL · arxiv.org