arXiv AI

A Mathematical Theory of the Jacobian Lens

The paper presents a mathematical theory of the Jacobian lens (J‑lens), an interpretability tool that identifies linear directions in language model hidden states resembling working‑memory representations. It shows that the J‑lens preferentially detects coherent features—directions that act as leading, spatially coherent Lyapunov modes—whose perturbations amplify across layers, remain stable across token positions, and are consistent across contexts. The authors validate their theory on a Bayes filter and a toy transformer trained on a Hidden Markov Model, demonstrating that task‑parameter‑induced changes in feature coherence predictably alter J‑lens responses, and introduce a family of ω‑J‑lenses that emphasize different temporal scales of information processing.

arXiv Computation and Language
Aug 27

Short Horizons and Sparse Concepts: a Mathematical View of the Readout in the J-lens

The paper presents a mathematical analysis of the Jacobian lens (J‑lens), a method for extracting verbalizable representations from language models. It treats the J‑lens as a first‑order causal transfer operator, showing that its Jacobian matrix serves as an optimal local linear approximation of downstream mappings and that its energy distribution is highly sparse, concentrating in diagonal pathways and critical positions. This sparse, short‑horizon structure explains why the J‑lens can effectively visualize concepts during a model’s reasoning process, and the authors propose a decoupling strategy that further improves its ability to read out correct intermediate concepts.

By Shi-Qi Yan, Kai-Xuan Ding, Chao-Hong Tan, Qian Chen, Wen Wang, Xiangang Li, Zhen-Hua Ling
arXiv AI
Jul 20

Verbalizable Representations Form a Global Workspace in Language Models

arXiv:2607. 15495v1 Announce Type: cross Abstract: Out of everything the human brain processes, only a small fraction is consciously accessible, in the sense of being available for verbal report, deliberate control, and flexible reasoning.

By Wes Gurnee, Nicholas Sofroniew, Adam Pearce, Mateusz Piotrowski, Isaac Kauvar, Runjin Chen, Anna Soligo, Paul Bogdan, Euan Ong, Rowan Wang, Ben Thompson, David Abrahams, Subhash Kantamneni, Emmanuel Ameisen, Joshua Batson, Jack Lindsey
arXiv Machine Learning
Sep 22

Comparing Latent Concept Formation in State Space Models and Transformers via Sparse Autoencoders

The paper compares latent representations in Selective State Space Models (SSMs) like Mamba and Transformers such as Pythia using Sparse Autoencoders. Across a 10‑million token corpus, 99.98% of Mamba features align closely with Pythia’s, supporting the Universality Hypothesis that core semantic representations are similar across architectures. A tiny 0.02% of features diverge, with Mamba’s recurrent bottleneck causing it to compress syntactic anomalies into polysemantic neurons, whereas Pythia’s attention can isolate distinct formatting edge‑cases.

By Rithin Nagaraj, Rupa Laalasa Oruganti, Prerna Subhashchandra Kunder, Ashwini M Joshi
arXiv Computation and Language
Aug 28

Planting a Latent Variable in Natural-Looking Text: a More Realistic Test of Belief States in LLMs and Their Link to Concept Geometry

The paper introduces a method to embed a controllable latent variable into natural-looking text by steering a teacher LLM along eight sparse autoencoder directions that follow a ring-shaped Markov chain. A small transformer trained on this data successfully tracks the Bayesian posterior of the planted variable and arranges the eight states in the same ring order, linking belief states to concept geometry. This demonstrates that LLMs can model latent variables and that concept geometry may arise from the statistical dynamics of these variables.

By Alexandru-Iulius Jerpelea
arXiv AI
Sep 3

Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?

The paper investigates whether a global workspace—a set of verbalisable, causally potent representations—emerges in transformer models that use recurrence instead of a stack of distinct layers. Using a Jacobian lens extended with a virtual‑unrolling adapter, the authors analyze two recurrent transformer architectures, Ouro‑2.6B and Huginn‑0125, and compare them to a standard Qwen3.6‑27B baseline. They find that a workspace does form in the iterated parts of both models, but recurrence alters how it can be accessed: Ouro reconstructs workspace content in every loop and requires writes and ablations across all loops, whereas Huginn forwards content across all recurrences but limits reads, writes, and ablations to a sliding window of about two recurrences.

By Wenlong Wang, Fergal Reid
arXiv AI
Sep 4

The Geometry of Ignorance: LLMs Know When to Temper Bayesian Priors

The paper identifies a single direction in the unembedding matrix of large language models that encodes the unigram distribution of the training corpus, acting as a Bayesian prior when the model is uncertain. By projecting the final prediction state onto this direction, the authors derive a per‑token prior loading factor, λ, which decreases as context becomes more informative and decomposes predictions into a tempered prior and a context‑driven likelihood. Experiments across four model families (Llama, Qwen, Gemma, Pythia) show that larger models rely less on the prior in high‑context settings and that manipulating λ can steer predictions toward or away from the unigram prior in KL divergence.

By Toni J. B. Liu, Jiajun Bao, Yizhou Liu, Gurbir Arora, Nicolas Boull\'e, Rapha\"el Sarfati, Christopher J. Earls
Hugging Face Trending Papers
Aug 27

Planting a Latent Variable in Natural-Looking Text: a More Realistic Test of Belief States in LLMs and Their Link to Concept Geometry

The paper investigates whether large language models (LLMs) maintain belief states—probability distributions over latent variables—by embedding a controllable latent variable into natural text. An LLM teacher generates ordinary text while subtly steering it along one of eight sparse autoencoder directions, which follow a ring-shaped Markov chain. A small transformer trained on this data successfully tracks the Bayesian posterior of the planted variable and arranges the eight states on a ring in the same order as the Markov chain, suggesting a link between concept geometry and latent variable dynamics.

arXiv AI
Oct 31

Jacobian Scopes: A Unified Geometric Framework for Token-Level LLM Attribution

The paper introduces Jacobian Scopes, a set of gradient‑based, token‑level causal attribution techniques for large language models (LLMs). These methods, grounded in perturbation theory and information geometry, measure how individual input tokens affect specific logits, the overall predictive distribution, and model uncertainty. Experiments on instruction understanding, translation, and in‑context learning tasks show that Jacobian Scopes uncover political biases, translation strategies, and mechanisms in time‑series forecasting, and outperform existing attribution methods on token‑ablation benchmarks across six LLMs.

By Toni J. B. Liu, Baran Zadeo\u{g}lu, Gurbir Arora, Rapha\"el Sarfati, Nicolas Boull\'e, Christopher J. Earls