mlsanityData to 14 Oct 2026

Placement Is Free, Composition Is Not: The Latin Square as a Provably-Balanced Construction for Heterogeneous Sequence-Mixer Stacks

arXiv 2609.20269 ↗First posted 29 Jul 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Since GPT, most Transformers have repeated the same attention mechanism at every layer. Yet this design is largely a convention rather than a tested conclusion. When multiple sequence mixers are combined in one stack, improvements may arise from mechanism choice, placement, or both, making causal attribution difficult. We introduce Aether-7B-5Attn, a 6.59B-parameter mixture-of-experts model (≈2.98B active) whose 49 layers contain seven sequence-mixing mechanisms arranged as a 7×7 Latin square. Because each mechanism appears exactly once in every row and column, the design guarantees balanced exposure across depth while eliminating placement confounds. To evaluate this principle, we build a parameter-matched proxy with four mechanisms arranged as a 4×4 Latin square over sixteen layers, matched to 700.9M parameters and trained with eight seeds per arm. The results reveal a clear dissociation. Rearranging a distributed heterogeneous stack into a balanced periodic cycle changes validation loss by only 0.16%, indicating that exact placement has little effect. In contrast, clustering the same mechanisms into contiguous depth bands incurs a 0.59% penalty, while replacing the heterogeneous stack with a homogeneous one incurs a 1.68% penalty. These results indicate that performance depends primarily on heterogeneous composition distributed across depth rather than on any particular permutation. We confirm this finding at 2.16× larger scale (1.514B parameters), where the homogeneous-stack penalty increases to 2.63% and removing the SSM-family mechanism produces a 3.20% degradation. We further report per-mechanism cost profiles, English and Korean evaluations, and a causal-safety audit of all 49 layers. We release model weights, training recipes, training code, logs, and architecture source code.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 37 references that are in the map. First posted on arXiv 29 Jul 2026.

Builds on

31 of 37 references.

References · 31

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  5. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  6. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  7. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  8. 2020Longformer: The Long-Document Transformercited by 3,413
  9. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  10. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  11. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
  12. 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,850
19 more
  1. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
  2. 2020Reformer: The Efficient Transformercited by 1,668
  3. 2020Rethinking Attention with Performerscited by 1,601
  4. 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
  5. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  6. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
  7. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
  8. 2022Simplified State Space Layers for Sequence Modelingcited by 788
  9. 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
  10. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 613
  11. 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 471
  12. 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 471
  13. 2022On the Parameterization and Initialization of Diagonal State Space Modelscited by 424
  14. 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 401
  15. 2023Hyena Hierarchy: Towards Larger Convolutional Language Modelscited by 393
  16. 2024xLSTM: Extended Long Short-Term Memorycited by 327
  17. 2024Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Modelscited by 242
  18. 2020ConvBERT: Improving BERT with Span-based Dynamic Convolutioncited by 88
  19. 2024RecurrentGemma: Moving Past Transformers for Efficient Open Language Modelscited by 64

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Hydra: Bidirectional State Space Models Through Generalized Matrix Mixers
  2. 2026DiTango: Cost-Effective Parallel Diffusion Generation with Selective Attention State Reuse
  3. 2025KnapFormer: An Online Load Balancer for Efficient Diffusion Transformers Training
  4. 2026SwiftFusion: Scalable Sequence Parallelism for Distributed Inference of Diffusion Transformers on GPUs
  5. 2025InstructMoLE: Instruction-Guided Mixture of Low-rank Experts for Multi-Conditional Image Generation
  6. 2024PoM: Efficient Image and Video Generation with the Polynomial Mixer
  7. 2024Unveiling Redundancy in Diffusion Transformers (DiTs): A Systematic Study
  8. 2026MOSAIC: Adaptive Inter-layer Composition for Efficient Heterogeneous Vision-Language Models