Interleaved Head Attention
Not on the map. Why?
Abstract (arXiv)
Multi-Head Attention (MHA) is the core computational primitive underlying modern Large Language Models (LLMs). However, MHA suffers from a fundamental linear scaling limitation: H attention heads produce exactly H independent attention matrices, with no communication between heads during attention computation. This becomes problematic for multi-step reasoning, where correct answers depend on aggregating evidence from multiple parts of the context and composing latent token-to-token relations over a chain of intermediate inferences. To address this, we propose Interleaved Head Attention (IHA), which enables cross-head mixing by constructing P pseudo-heads per head (typically P=H), where each pseudo query/key/value is a learned linear combination of all H original queries, keys and values respectively. Interactions between pseudo-query and pseudo-key heads induce up to P2 attention patterns per head with modest parameter overhead O(H2P). We provide theory showing improved efficiency in terms of number of parameters on the synthetic Polynomial task (IHA uses Theta(√kn2) parameters vs. Theta(kn2) for MHA) and on the synthetic order-sensitive CPM-3 task (IHA uses lceil√Nmaxrceil heads vs. Nmax for MHA). On real-world benchmarks, IHA improves Multi-Key retrieval on RULER by 10-20% (4k-16k) and, after fine-tuning for reasoning on OpenThoughts, improves GSM8K by 5.8% and MATH-500 by 2.8% (Majority Vote) over full attention.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 29 references that are in the map. First posted on arXiv 24 Feb 2026.
Builds on
26 of 29 references.
References · 26
- 2017Attention Is All You Needcited by 59,932
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
14 more
- 2017Mixed Precision Trainingcited by 1,135
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
- 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 641
- 2015Towards AI-Complete Question Answering: A Set of Prerequisite Toy Taskscited by 309
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
- 2023Representational Strengths and Limitations of Transformerscited by 132
- 2020Talking-Heads Attentioncited by 57
- 2025Strassen Attention, Split VC Dimension and Compositionality in Transformerscited by 12
- 2025Multi-Token Attentioncited by 10
- 2019Logic and the 2-Simplicial Transformercited by 9
- 2025Fast and Simplex: 2-Simplicial Attention in Tritoncited by 8
- 2021A Piece-wise Polynomial Filtering Approach for Graph Neural Networkscited by 7
- 2023FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentationscited by 2
- 2025Knocking-Heads Attentioncited by 1
Built on by
Not cited yet.