๐ค AI Summary
This work investigates the expressive power and structural bottlenecks of Looped Transformers in sequence-to-sequence function approximation. We identify a fundamental theoretical limitation arising from their fixed-loop architecture and, for the first time, establish an approximation-rate analysis frameworkโproving that expressive capacity strictly increases with loop count. To overcome this architectural ceiling, we propose a learnable loop-scaling mechanism grounded in timestep-aware positional encoding. Our method integrates modulus-of-continuity theory for functional approximation analysis, parameterized timestep encoding, and empirical validation. Experiments across multiple reasoning benchmarks demonstrate significant performance gains over strong baselines. Collectively, this work advances both the theoretical understanding and practical optimization of recurrent-style Transformers, establishing a new paradigm for analyzing and enhancing loop-based sequence modeling architectures.
๐ Abstract
Looped Transformers provide advantages in parameter efficiency, computational capabilities, and generalization for reasoning tasks. However, their expressive power regarding function approximation remains underexplored. In this paper, we establish the approximation rate of Looped Transformers by defining the modulus of continuity for sequence-to-sequence functions. This reveals a limitation specific to the looped architecture. That is, the analysis prompts the incorporation of scaling parameters for each loop, conditioned on timestep encoding. Experiments validate the theoretical results, showing that increasing the number of loops enhances performance, with further gains achieved through the timestep encoding.