mlsanityData to 7 Oct 2026

WhiteMatter: All-to-All Cross-Layer Connections via KV Source Mixing

arXiv 2608.18486 ↗First posted 19 Aug 2026cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

When generating text, a Transformer produces representations of past tokens at every layer, but each layer can normally use only representations from the same depth. This restriction prevents the model from fully reusing information it has already computed. We introduce WhiteMatter, which allows every layer to draw on past-token representations from any depth. A learned mixer selects the most useful depths for the current context and combines their representations into shared key-value (KV) cache channels. Sharing these channels across layers can reduce the cache size. Given the same number of training tokens, WhiteMatter with a full-size cache performs comparably to a standard Transformer with 50% more layers. With half the KV cache, WhiteMatter outperforms matched standard Transformers at two model scales, up to 1.3B parameters. Cross-layer connections, however, introduce dependencies that slow training and prompt processing. We address this problem with cyclic iteration, which updates interleaved groups of tokens in turn while processing the tokens within each group in parallel. On a reference model trained with exact autoregressive execution, cyclic iteration converges 12.5x faster than standard Jacobi iteration.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 42 references that are in the map. First posted on arXiv 19 Aug 2026.

Builds on

32 of 42 references.

References · 32

  1. 2017Attention Is All You Needcited by 59,932
  2. 2025Qwen3 Technical Reportcited by 8,195
  3. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  4. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  5. 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
  6. 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 135
  7. 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attentioncited by 122
  8. 2024Hyper-Connectionscited by 81
  9. 2025mHC: Manifold-Constrained Hyper-Connectionscited by 76
  10. 2024Layer-Condensed KV Cache for Efficient Inference of Large Language Modelscited by 58
  11. 2026Attention Residualscited by 57
  12. 2024DenseFormer: Enhancing Information Flow in Transformers via Depth Weighted Averagingcited by 48
20 more
  1. 2025PonderLM: Pretraining Language Models to Ponder in Continuous Spacecited by 44
  2. 2025MUDDFormer: Breaking Residual Bottlenecks in Transformers via Multiway Dynamic Dense Connectionscited by 27
  3. 2024Value Residual Learningcited by 25
  4. 2024MLKV: Multi-Layer Key-Value Heads for Memory Efficient Transformer Decodingcited by 20
  5. 2024A Systematic Study of Cross-Layer KV Sharing for Efficient LLM Inferencecited by 16
  6. 2025PonderLM-2: Pretraining LLM with Latent Thoughts in Continuous Spacecited by 14
  7. 2021Staircase Attention for Recurrent Processing of Sequencescited by 13
  8. 2025Utility-Driven Speculative Decoding for Mixture-of-Expertscited by 12
  9. 2026AdaPonderLM: Gated Pondering Language Models with Token-Wise Adaptive Depthcited by 9
  10. 2025DeepCrossAttention: Supercharging Transformer Residual Connectionscited by 7
  11. 2026Delta Attention Residualscited by 7
  12. 2024LAuReL: Learned Augmented Residual Layercited by 6
  13. 2026T^2MLR: Transformer with Temporal Middle-Layer Recurrencecited by 6
  14. 2026The Recurrent Transformer: Greater Effective Depth and Efficient Decodingcited by 5
  15. 2026Latent Recurrent Transformer: Architecture Exploration, Training Strategies, and Scaling Behaviorcited by 5
  16. 2025Reconstructing KV Caches with Cross-layer Fusion For Enhanced Transformerscited by 4
  17. 2026Agentic AI Workload Characteristicscited by 4
  18. 2026PonderLM-3: Adaptive Token-Wise Pondering with Differentiable Maskingcited by 3
  19. 2026Stochastic KV Routing: Enabling Adaptive Depth-Wise Cache Sharingcited by 3
  20. 2026Transformers with Selective Access to Early Representationscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Improving Model Representation and Reducing KV Cache via Skip Connections with First Value Heads
  2. 2026KV-Pipe: On the Relation Between KV Sharing and Pipeline Parallel Efficiency in LLMs
  3. 2026Sub-Token Routing for KV Cache Compression
  4. 2026The Surprising Effectiveness of Shared Memory in Looped Transformers
  5. 2024KVSharer: Efficient Inference via Layer-Wise Dissimilar KV Cache Sharing
  6. 2025LLMCache: Layer-Wise Caching Strategies for Accelerated Reuse in Transformer Inference
  7. 2026MixFormer: Linear Transformer with Mixture of Memory Experts
  8. 2025Compress, Gather, and Recompute: REFORMing Long-Context Processing in Transformers