aspireai.
PUBLIC EDITION

Which words in the prompt actually caused the prediction: a geometric attribution method beat standard gradient methods in 10 of 12 settings

AspireAI community · arXiv (cs.CL / cs.AI)
Jacobian Scopes are gradient-based token-level causal attribution methods grounded in perturbation theory and information geometry, quantifying how each input token influences specific logits, the whole predictive distribution, or model uncertainty. Case studies across instruction understanding, translation and in-context learning show the method surfacing implicit political biases, phrase-level translation strategies and mechanisms behind in-context time-series forecasting. On token-ablation faithfulness benchmarks (LAMBADA and IWSLT2017) across six models, the distribution-level Fisher and Temperature Scopes significantly outperformed established gradient-based attribution methods in 10 of 12 model-dataset settings, with implementations open-sourced and an interactive demo hosted. The limitation: it measures faithfulness to the model's own computation, which is not the same as whether the attribution is causally true of the world.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.