mlsanityData to 14 Oct 2026

Zero Token-Driven Deep Thinking in LLMs: Unlocking the Full Potential of Existing Parameters via Cyclic Refinement

arXiv 2502.12214 ↗First posted 17 Feb 2025cs.CL cs.AIcited by 5

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

also in 1 more
Abstract (arXiv)

Resource limitations often constrain the parameter counts of Large Language Models (LLMs), hindering their performance. While existing methods employ parameter sharing to reuse the same parameter set under fixed budgets, such approaches typically force each layer to assume multiple roles with a predetermined number of iterations, restricting efficiency and adaptability. In this work, we propose the Zero Token Transformer (ZTT), which features a head-tail decoupled parameter cycling method. We disentangle the first (head) and last (tail) layers from parameter cycling and iteratively refine only the intermediate layers. Furthermore, we introduce a Zero-Token Mechanism, an internal architectural component rather than an input token, to guide layer-specific computation. At each cycle, the model retrieves a zero token (with trainable key values) from a Zero-Token Pool, integrating it alongside regular tokens in the attention mechanism. The corresponding attention scores not only reflect each layer's computational importance but also enable dynamic early exits without sacrificing overall model accuracy. Our approach achieves superior performance under tight parameter budgets, effectively reduces computational overhead via early exits, and can be readily applied to fine-tune existing pre-trained models for enhanced efficiency and adaptability.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 32 of its 45 references that are in the map. First posted on arXiv 17 Feb 2025.

Builds on

32 of 45 references.

References · 32

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  5. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  6. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  7. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,653
  8. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  9. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,202
  10. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  11. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  12. 2018Universal Transformerscited by 647
20 more
  1. 2022Efficiently Scaling Transformer Inferencecited by 539
  2. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  3. 2018Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Networkcited by 420
  4. 2023LLM-QAT: Data-Free Quantization Aware Training for Large Language Modelscited by 324
  5. 2019A Constructive Prediction of the Generalization Error Across Scalescited by 210
  6. 2024A Survey on Efficient Inference for Large Language Modelscited by 205
  7. 2023SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scalingcited by 172
  8. 2021PonderNet: Learning to Pondercited by 168
  9. 2021Lessons on Parameter Sharing across Layers in Transformerscited by 85
  10. 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 78
  11. 2023EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelismcited by 69
  12. 2024MoEUT: Mixture-of-Experts Universal Transformerscited by 59
  13. 2024Transformer Layers as Painterscited by 54
  14. 2018Recurrent Stacking of Layers for Compact Neural Machine Translation Modelscited by 38
  15. 2023Sparse Universal Transformercited by 32
  16. 2019Learning Implicitly Recurrent CNNs Through Parameter Sharingcited by 27
  17. 2024EE-Tuning: An Economical yet Scalable Solution for Tuning Early-Exit Large Language Modelscited by 13
  18. 2013Understanding Deep Architectures using a Recursive Convolutional Networkcited by 11
  19. 2024FIRST: Teach A Reliable Large Language Model Through Efficient Trustworthy Distillationcited by 11
  20. 2023LAIT: Efficient Multi-Segment Encoding in Transformers with Layer-Adjustable Interactioncited by 7

Built on by

Cited by year (2026 to 14 Oct)

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

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025ZeroTuning: Unlocking the Initial Token's Power to Enhance Large Language Models Without Training
  2. 2024Leveraging Zero-Shot Prompting for Efficient Language Model Distillation
  3. 2024Extending Token Computation for LLM Reasoning
  4. 2026Think Deep, Not Just Long: Measuring LLM Reasoning Effort via Deep-Thinking Tokens
  5. 2024Active-Dormant Attention Heads: Mechanistically Demystifying Extreme-Token Phenomena in LLMs
  6. 2025PromptDistill: Query-based Selective Token Retention in Intermediate Layers for Efficient Large Language Model Inference
  7. 2025DeepQuestion: Systematic Generation of Real-World Challenges for Evaluating LLMs Performance
  8. 2026CLAA: Cross-Layer Attention Aggregation for Accelerating LLM Prefill