The Dual-Stream Transformer: Channelized Architecture for Interpretable Language Modeling
Not on the map. Why?
Abstract (arXiv)
Standard transformers entangle all computation in a single residual stream, obscuring which components perform which functions. We introduce the Dual-Stream Transformer, which decomposes the residual stream into two functionally distinct components: a token stream updated by attention and a context stream updated by feed-forward networks. Information flow between attention heads is controlled through a hierarchy of mixing strategies, from fully independent (maximum interpretability) to dense (standard transformer behavior). This design exposes a tunable tradeoff between interpretability and performance. We measure this tradeoff on language modeling tasks at 29M parameters. Fully independent head mixing increases validation loss by 8% relative to dense baselines. The recommended Kronecker mixing strategy, which permits scalar communication between heads while preserving within-head structure, costs only 2.5%. All configurations maintain functional generation under attention amplification (scaling logits by factors up to 16 at inference time), with degradation ranging from 16% to 27%. This robustness suggests the architectures learn discrete algorithms that operate independently of soft probabilistic mixing. The architecture provides a foundation for interpretable language models where internal structure is exposed by design. footnoteThis work was partially supported by DARPA Contract HR001125C0302.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 35 of its 43 references that are in the map. First posted on arXiv 8 Mar 2026.
Builds on
35 of 43 references.
References · 35
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,046
23 more
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2022In-context Learning and Induction Headscited by 930
- 2022Toy Models of Superpositioncited by 928
- 2019Attention is not Explanationcited by 916
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 831
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
- 2019Attention is not not Explanationcited by 629
- 2021Causal Abstractions of Neural Networkscited by 401
- 2015Neural Module Networkscited by 375
- 2019Revealing the Dark Secrets of BERTcited by 300
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2023The Hydra Effect: Emergent Self-repair in Language Model Computationscited by 145
- 2021Position Information in Transformers: An Overviewcited by 103
- 2024Softmax is not Enough (for Sharp Size Generalisation)cited by 42
- 2023Seeing is Believing: Brain-Inspired Modular Training for Mechanistic Interpretabilitycited by 38
- 2024Selective Attention Improves Transformercited by 26
- 2025Cognitive Mirrors: Exploring the Diverse Functional Roles of Attention Heads in LLM Reasoningcited by 5
- 2025Learning When to Stop: Adaptive Latent Reasoning via Reinforcement Learningcited by 4
- 2025JEPA-Reasoner: Decoupling Latent Reasoning from Token Generationcited by 4
- 2025MoKA: Mixture of Kronecker Adapterscited by 2
- 2026Weights to Code: Extracting Interpretable Algorithms from the Discrete Transformercited by 2
- 2025Weaver: Kronecker Product Approximations of Spatiotemporal Attention for Traffic Network Forecastingcited by 1
Built on by
Citing papers per year: 2026: 3.
3 papers.