mlsanityData to 7 Oct 2026

Extending Token Computation for LLM Reasoning

arXiv 2403.14932 ↗First posted 22 Mar 2024cs.CL cs.AIcited by 3

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Large Language Models (LLMs) are pivotal in advancing natural language processing but often struggle with complex reasoning tasks due to inefficient attention distributions. In this paper, we explore the effect of increased computed tokens on LLM performance and introduce a novel method for extending computed tokens in the Chain-of-Thought (CoT) process, utilizing attention mechanism optimization. By fine-tuning an LLM on a domain-specific, highly structured dataset, we analyze attention patterns across layers, identifying inefficiencies caused by non-semantic tokens with outlier high attention scores. To address this, we propose an algorithm that emulates early layer attention patterns across downstream layers to re-balance skewed attention distributions and enhance knowledge abstraction. Our findings demonstrate that our approach not only facilitates a deeper understanding of the internal dynamics of LLMs but also significantly improves their reasoning capabilities, particularly in non-STEM domains. Our study lays the groundwork for further innovations in LLM design, aiming to create more powerful, versatile, and responsible models capable of tackling a broad range of real-world applications.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 19 of its 27 references that are in the map. First posted on arXiv 22 Mar 2024.

Builds on

19 of 27 references.

Closest ancestors · 1

Same direction, newest first

  1. 2022STaR: Bootstrapping Reasoning With Reasoning28 Mar

Other references · 18

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2023GPT-4 Technical Reportcited by 18,132
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  6. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  7. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  8. 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  11. 2023Code Llama: Open Foundation Models for Codecited by 2,105
  12. 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
6 more
  1. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
  2. 2020Generative Language Modeling for Automated Theorem Provingcited by 379
  3. 2024Massive Activations in Large Language Modelscited by 277
  4. 2016Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Taskscited by 216
  5. 2023AttentionViz: A Global View of Transformer Attentioncited by 50
  6. 2024The First Place Solution of WSDM Cup 2024: Leveraging Large Language Models for Conversational Multi-Doc QAcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026A State-Transition Framework for Efficient LLM Reasoning
  2. 2026Think Deep, Not Just Long: Measuring LLM Reasoning Effort via Deep-Thinking Tokens
  3. 2025TokenSkip: Controllable Chain-of-Thought Compression in LLMs
  4. 2025Focused Chain-of-Thought: Efficient LLM Reasoning via Structured Input Information
  5. 2024Token-Budget-Aware LLM Reasoning
  6. 2025Token Assorted: Mixing Latent and Text Tokens for Improved Language Model Reasoning
  7. 2025Attention Reveals More Than Tokens: Training-Free Long-Context Reasoning with Attention-guided Retrieval
  8. 2025Expanding Computation Spaces of LLMs at Inference Time