Mobius Learning: Cyclic Depth Folding in Transformers
Not on the map. Why?
Abstract (arXiv)
Transformer-based language models organize computation along an ordered depth axis, where shallow and deep blocks often develop distinct representational roles. We challenge the conventional view that these roles must remain tied to a block's position in the ordered sequence. We introduce Mobius Learning, a training architecture based on cyclic depth folding, in which different data streams follow cyclically shifted block orders. The same block group is therefore applied early in the block sequence for some data streams and late for others, so it is optimized in both shallow and deep roles, a phenomenon we call depth-role superposition. Surprisingly, in four-worker experiments with a modded GPT-2 small (124M) model trained on 2.5B FineWeb tokens using Muon, Mobius Learning achieves lower validation loss than a fixed-order looped Transformer at larger numbers of Transformer block-sequence passes. This counterintuitive result shows that a block group need not remain confined to one fixed shallow or deep role within the block sequence and opens a new design space based on cyclic depth folding. Crucially, this structure makes Mobius Learning particularly well suited to memory-constrained distributed training: raw training data remain local, while each worker stores one block group rather than the complete Transformer block stack.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 22 references that are in the map. First posted on arXiv 20 Jul 2026.
Builds on
18 of 22 references.
References · 18
- 2017Attention Is All You Needcited by 59,932
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,046
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
- 2018Split learning for health: Distributed deep learning without sharing raw patient datacited by 391
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
6 more
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
- 2019The Bottom-up Evolution of Representations in the Transformer: A Study with Machine Translation and Language Modeling Objectivescited by 139
- 2021Lessons on Parameter Sharing across Layers in Transformerscited by 85
- 2026Parcae: Scaling Laws For Stable Looped Language Modelscited by 45
- 2021Subformer: Exploring Weight Sharing for Parameter Efficiency in Generative Transformerscited by 42
- 2024LayerShuffle: Enhancing Robustness in Vision Transformers by Randomizing Layer Execution Ordercited by 2
Built on by
Not cited yet.