mlsanityData to 14 Oct 2026

Induced Natural Language Rationales and Interleaved Markup Tokens Enable Extrapolation in Large Language Models

arXiv 2208.11445 ↗First posted 24 Aug 2022cs.CLcited by 10

Not on the map. Why?

Abstract (arXiv)

The ability to extrapolate, i.e., to make predictions on sequences that are longer than those presented as training examples, is a challenging problem for current deep learning models. Recent work shows that this limitation persists in state-of-the-art Transformer-based models. Most solutions to this problem use specific architectures or training methods that do not generalize to other tasks. We demonstrate that large language models can succeed in extrapolation without modifying their architecture or training procedure. Our experimental results show that generating step-by-step rationales and introducing marker tokens are both required for effective extrapolation. First, we induce a language model to produce step-by-step rationales before outputting the answer to effectively communicate the task to the model. However, as sequences become longer, we find that current models struggle to keep track of token positions. To address this issue, we interleave output tokens with markup tokens that act as explicit positional and counting symbols. Our findings show how these two complementary approaches enable remarkable sequence extrapolation and highlight a limitation of current architectures to effectively generalize without explicit surface form guidance. Code available at https://github.com/MirelleB/induced-rationales-markup-tokens

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 49 of its 66 references that are in the map. First posted on arXiv 24 Aug 2022.

Builds on

49 of 66 references.

References · 49

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
  6. 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,407
  7. 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,103
  8. 2022STaR: Bootstrapping Reasoning With Reasoningcited by 940
  9. 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 886
  10. 2018Universal Transformerscited by 647
  11. 2019Measuring Compositional Generalization: A Comprehensive Method on Realistic Datacited by 284
  12. 2018Deep Learning: A Critical Appraisalcited by 217
37 more
  1. 2016Modular Multitask Reinforcement Learning with Policy Sketchescited by 203
  2. 2019Do NLP Models Know Numbers? Probing Numeracy in Embeddingscited by 159
  3. 2019Good-Enough Compositional Data Augmentationcited by 158
  4. 2020Compositional Generalization and Natural Language Variation: Can a Semantic Parsing Approach Handle Both?cited by 147
  5. 2021Investigating the Limitations of Transformers with Simple Arithmetic Taskscited by 139
  6. 2020Injecting Numerical Reasoning Skills into Language Modelscited by 133
  7. 2015Neural GPUs Learn Algorithmscited by 121
  8. 2020Compositional Generalization in Semantic Parsing: Pre-training vs. Specialized Architecturescited by 95
  9. 2016Learning to Compose Neural Networks for Question Answeringcited by 85
  10. 2021Representing Numbers in NLP: a Survey and a Visioncited by 83
  11. 2020Compositional Generalization via Neural-Symbolic Stack Machinescited by 80
  12. 2020Span-based Semantic Parsing for Compositional Generalizationcited by 77
  13. 2015Inferring Algorithmic Patterns with Stack-Augmented Recurrent Netscited by 76
  14. 2020Learning Compositional Rules via Neural Program Synthesiscited by 74
  15. 2018Neural Arithmetic Logic Unitscited by 70
  16. 2020Do Language Embeddings Capture Scales?cited by 63
  17. 2020Learning to Encode Position for Transformer with Continuous Dynamical Modelcited by 61
  18. 2019Compositional generalization in a deep seq2seq model by separating syntax and semanticscited by 56
  19. 2020Compositional Generalization by Learning Analytical Expressionscited by 53
  20. 2019Giving BERT a Calculator: Finding Operations and Arguments with Reading Comprehensioncited by 51
  21. 2019Compositional Generalization for Primitive Substitutionscited by 48
  22. 2021Improving Compositional Generalization with Latent Structure and Data Augmentationcited by 46
  23. 2018Memorize or generalize? Searching for a compositional RNN in a haystackcited by 41
  24. 2019Enhancing the Transformer with Explicit Relational Encoding for Math Problem Solvingcited by 35
  25. 2022Unobserved Local Structures Make Compositional Generalization Hardcited by 29
  26. 2021Symbolic Brittleness in Sequence Models: on Systematic Generalization in Symbolic Mathematicscited by 27
  27. 2015Grid Long Short-Term Memorycited by 20
  28. 2022Learning to Scaffold: Optimizing Model Explanations for Teachingcited by 20
  29. 2021Exploring Generalization Ability of Pretrained Language Models on Arithmetic and Logical Reasoningcited by 17
  30. 2021Teaching Autoregressive Language Models Complex Tasks By Demonstrationcited by 15
  31. 2019Text2Math: End-to-end Parsing Text into Math Expressionscited by 13
  32. 2021Investigating Numeracy Learning Ability of a Text-to-Text Transfer Modelcited by 13
  33. 2021Compositional Attention: Disentangling Search and Retrievalcited by 12
  34. 2022What Makes Instruction Learning Hard? An Investigation and a New Challenge in a Synthetic Environmentcited by 9
  35. 2016Extensions and Limitations of the Neural GPUcited by 7
  36. 2021Learning to Generalize Compositionally by Transferring Across Semantic Parsing Taskscited by 6
  37. 2019Quantity Tagger: A Latent-Variable Sequence Labeling Approach to Solving Addition-Subtraction Word Problemscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 5; 2024: 3; 2025: 0; 2026: 2.

10 papers.