fmxcoders: Factorized Masked Crosscoders for Cross-Layer Feature Discovery
Not on the map. Why?
Abstract (arXiv)
Many features in pretrained Transformers span multiple layers: they emerge through stages of inference, persist in the residual stream, or are built jointly by parallel MLPs. Crosscoders (namely, sparse dictionaries trained jointly across layers) aim to recover these cross-layer features in a single shared latent space. We show that standard crosscoders largely fail at this purpose. Although their decoder weight norms spread evenly across layers, a functional coherence metric we introduce reveals that each latent's activation is effectively driven by only one or two layers on average. While functionally coherent latents act as human-interpretable concept detectors (e.g., US states and cities), the layer-localized latents that crosscoders predominantly learn collapse onto surface-level patterns such as digit detectors. We trace this failure to two structural limitations: unconstrained cross-layer parameterization and unregularized cross-layer dependence. We address both by introducing fmxcoders, which (i) replace the encoder and decoder with low-rank tensor factorizations that draw every latent's per-layer weights from a shared cross-layer basis, and (ii) apply stochastic layer masking, a denoising regularizer along the layer axis that penalizes latents whose contribution collapses when a single layer is masked. Across GPT2-Small, Pythia-410M, Pythia-1.4B, and Gemma2-2B, fmxcoders lift mean probing F1 by 10-30 points, surpassing per-layer SAE baselines that standard crosscoders fail to reach, reduce reconstruction MSE by 25-50%, and roughly double mean functional coherence. An LLM-as-a-judge evaluation further shows that fmxcoders recover 3-13× more semantically coherent latents than standard crosscoders across all four base LLMs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 36 of its 52 references that are in the map. First posted on arXiv 10 May 2026.
Builds on
36 of 52 references.
References · 36
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2022Toy Models of Superpositioncited by 928
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2021Knowledge Neurons in Pretrained Transformerscited by 590
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 522
24 more
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
- 2019Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Settingcited by 346
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
- 2025Open Problems in Mechanistic Interpretabilitycited by 173
- 2024The Remarkable Robustness of LLMs: Stages of Inference?cited by 138
- 2024BatchTopK Sparse Autoencoderscited by 126
- 2016Tensor Ring Decompositioncited by 125
- 2025SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretabilitycited by 118
- 2024Universal Neurons in GPT2 Language Modelscited by 100
- 2016Deep Multi-task Representation Learning: A Tensor Factorisation Approachcited by 69
- 2021Tensor Methods in Computer Vision and Deep Learningcited by 52
- 2025Overcoming Sparsity Artifacts in Crosscoders to Interpret Chat-Tuningcited by 31
- 2024Multilinear Mixture of Experts: Scalable Expert Specialization through Factorizationcited by 28
- 2025Towards Understanding Distilled Reasoning Models: A Representational Approachcited by 26
- 2024Mechanistic Permutability: Match Features Across Layerscited by 21
- 2024Residual Stream Analysis with Multi-Layer SAEscited by 18
- 2024Understanding polysemanticity in neural networks through coding theorycited by 17
- 2025Evolution of Concepts in Language Model Pre-Trainingcited by 8
- 2025Crosscoding Through Time: Tracking Emergence & Consolidation Of Linguistic Representations Throughout LLM Pretrainingcited by 6
- 2025Internal states before wait modulate reasoning patternscited by 6
- 2025Foundation Models for Discovery and Exploration in Chemical Spacecited by 6
- 2025Towards Interpretability Without Sacrifice: Faithful Dense Layer Decomposition with Mixture of Decoderscited by 5
- 2026PolySAE: Modeling Feature Interactions in Sparse Autoencoders via Polynomial Decodingcited by 3
Built on by
Not cited yet.