paper-with-me

홈 › Papers

What Makes Looped Transformers Perform Better Than Non-Recursive Ones

2025-10-11 · Zixuan Gong, Yong Liu, Jiaye Teng arxiv

While looped transformers (termed as Looped-Attn) often outperform standard transformers (termed as Single-Attn) on complex reasoning tasks, the mechanism for this advantage remains underexplored. In this paper, we explain this phenomenon through the lens of loss landscape geometry, inspired by empirical observations of their distinct dynamics at both sample and Hessian levels. To formalize this, we extend the River-Valley landscape model by distinguishing between U-shaped valleys (flat) and V-shaped valleys (steep). Based on empirical observations, we conjecture that the recursive architecture of Looped-Attn induces a landscape-level inductive bias towards River-V-Valley. This inductive bias suggest a better loss convergence along the river due to valley hopping, and further encourage learning about complex patterns compared to the River-U-Valley induced by Single-Attn. Building on this insight, we propose SHIFT (Staged HIerarchical Framework for Progressive Training), a principled training strategy that accelerates the training process of Looped-Attn while achieving comparable performances.

📄 PDF Abstract BibTeX arXiv:2510.10089

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the Residual Scaling of Looped Transformers: Stability and Transferability

2026-06-16 · Shaowen Wang, Bingrui Li, Ge Zhang, Wenhao Huang 외 arxiv

Looped (weight-tied) Transformers apply a shared residual block $N$ times ($h \leftarrow h + \varepsilon\,f(h)$, same $f$ at each step), increasing effective depth without adding parameters. Prior depth-scaling analyses …

Sparse Layers are Critical to Scaling Looped Language Models

2026-05-09 · Ryan Lee, Jacob Biloki, Edward J. Hu, Jonathan May arxiv

Looped language models repeat a set of transformer layers through depth, reducing memory costs and providing natural early-exit points at loop boundaries. However, looped models do not scale as favorably as standard tran…

SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursion

2026-02-12 · Chengting Yu, Xiaobo Shu, Yadao Wang, Yizhen Zhang 외 arxiv

Recursive (looped) Transformers decouple computational depth from parameter depth by repeatedly applying shared layers, providing an explicit architectural primitive for iterative refinement and latent reasoning. However…

Hyperloop Transformers

2026-04-23 · Abbas Zeitoun, Lucas Torroba-Hennigen, Yoon Kim arxiv

LLM architecture research generally aims to maximize model quality subject to fixed compute/latency budgets. However, many applications of interest such as edge and on-device deployment are further constrained by the mod…

On the Reasoning Abilities of Masked Diffusion Language Models

2025-10-15 · Anej Svete, Ashish Sabharwal arxiv

Masked diffusion models (MDMs) for text offer a compelling alternative to traditional autoregressive language models. Parallel generation makes them efficient, but their computational capabilities and the limitations inh…