mlsanityData to 14 Oct 2026

Pause Tokens Strictly Increase the Expressivity of Constant-Depth Transformers

arXiv 2505.21024 ↗First posted 27 May 2025cs.LG cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Pause tokens, simple filler symbols such as "...", consistently improve Transformer performance on both language and mathematical tasks, yet their theoretical effect remains unexplained. We provide the first formal separation result, proving that adding pause tokens to constant-depth, logarithmic-width Transformers strictly increases their computational expressivity. With bounded-precision activations, Transformers without pause tokens compute only a strict subset of mathsfAC0 functions, while adding a polynomial number of pause tokens allows them to express the entire class. For logarithmic-precision Transformers, we show that adding pause tokens achieves expressivity equivalent to mathsfTC0, matching known upper bounds. Empirically, we demonstrate that two-layer causally masked Transformers can learn parity when supplied with pause tokens, a function that they appear unable to learn without them. Our results provide a rigorous theoretical explanation for prior empirical findings, clarify how pause tokens interact with width, depth, and numeric precision, and position them as a distinct mechanism, complementary to chain-of-thought prompting, for enhancing Transformer reasoning.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 26 of its 42 references that are in the map. First posted on arXiv 27 May 2025.

Builds on

26 of 42 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  5. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  6. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  7. 2023Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Promptingcited by 1,122
  8. 2023Measuring Faithfulness in Chain-of-Thought Reasoningcited by 703
  9. 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 288
  10. 2022Transformers Learn Shortcuts to Automatacited by 268
  11. 2023Think before you speak: Training Language Models With Pause Tokenscited by 264
  12. 2024Chain of Thought Empowers Transformers to Solve Inherently Serial Problemscited by 260
14 more
  1. 2022Neural Networks and the Chomsky Hierarchycited by 217
  2. 2022The Parallelism Tradeoff: Limitations of Log-Precision Transformerscited by 193
  3. 2024Let's Think Dot by Dot: Hidden Computation in Transformer Language Modelscited by 191
  4. 2023Representational Strengths and Limitations of Transformerscited by 133
  5. 2019On the Turing Completeness of Modern Neural Network Architecturescited by 129
  6. 2023What Formal Languages Can Transformers Express? A Surveycited by 124
  7. 2022Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexitycited by 93
  8. 2020Memory Transformercited by 76
  9. 2024On Limitations of the Transformer Architecturecited by 63
  10. 2024Theoretical limitations of multi-layer Transformercited by 45
  11. 2024Separations in the Representational Capabilities of Transformers and Recurrent Architecturescited by 29
  12. 2024Transformers in Uniform TC0cited by 25
  13. 2015Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuitscited by 6
  14. 2024Understanding Hidden Computations in Chain-of-Thought Reasoningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 3.

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Sparse Token Routing in Efficient Transformers
  2. 2025Dynamical Properties of Tokens in Self-Attention and Effects of Positional Encoding
  3. 2025A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers
  4. 2026The Expressive Power of Low Precision Softmax Transformers with (Summarized) Chain-of-Thought
  5. 2026Adaptive Computation Depth via Learned Token Routing in Transformers
  6. 2026Every Bit Counts: A Theoretical Study of Precision-Expressivity Tradeoffs in Quantized Transformers
  7. 2025Exact Expressive Power of Transformers with Padding
  8. 2025Learning to Skip the Middle Layers of Transformers