mlsanityData to 7 Oct 2026

LoopCD: Loop-wise Contrastive Decoding for Improving Reasoning in Looped Language Models

arXiv 2609.24196 ↗First posted 21 Sep 2026cs.CLcited by 0

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

Abstract (arXiv)

Looped Language Models (LoopLMs) perform "latent reasoning" by recursively refining internal latent representations with shared weights, offering a more effective alternative to explicit verbal reasoning. Despite their effectiveness, we find that LoopLMs remain prone to loop instability: unstable refinement across iterations can produce localized uncertain "hard" tokens associated with reasoning errors. To address this, we propose LoopCD, loop-wise contrastive decoding that enhances the reasoning performance of LoopLMs by intervening on these tokens at inference time. Specifically, we exploit the internal dynamics of LoopLMs and contrast the logits from earlier iterations with logits from the last refined iteration to form the final sampling distribution. We find that this strategy is highly efficient, introducing only negligible inference overhead and requiring no additional training, while effectively improving reasoning performance by naturally refining reasoning-critical hard tokens. Extensive experiments show that our method improves the performance of recent representative LoopLMs across various reasoning tasks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 20 of its 45 references that are in the map. First posted on arXiv 21 Sep 2026.

Builds on

20 of 45 references.

Closest ancestors · 6

Same direction, newest first

  1. 2025Scaling Latent Reasoning via Looped Language Models29 Oct
  2. 2025Less is More: Recursive Reasoning with Tiny Networks6 Oct
  3. 2025Deep Think with Confidence21 Aug
  4. 2025Hierarchical Reasoning Model26 Jun
  5. 2023Contrastive Decoding Improves Reasoning in Large Language Models17 Sep
  6. 2023Large Language Model Guided Tree-of-Thought15 May

Other references · 14

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2020Denoising Diffusion Implicit Modelscited by 9,655
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  4. 2022Classifier-Free Diffusion Guidancecited by 5,717
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  6. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  7. 2023Let's Verify Step by Stepcited by 3,598
  8. 2021Program Synthesis with Large Language Modelscited by 3,509
  9. 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
  10. 2025OpenAI GPT-5 System Cardcited by 910
  11. 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
  12. 2024DeepSeek-V3 Technical Reportcited by 724
2 more
  1. 2025Reinforcement Learning with Verifiable Rewards Implicitly Incentivizes Correct Reasoning in Base LLMscited by 276
  2. 2025Universal Reasoning Modelcited by 11

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Closing the Loop: Practical Training Recipes for Looped Language Models
  2. 2026LoopFormer: Elastic-Depth Looped Transformers for Latent Reasoning via Shortcut Modulation
  3. 2026A Mechanistic Analysis of Looped Reasoning Language Models
  4. 2026Thinking by Subtraction: Confidence-Driven Contrastive Decoding for LLM Reasoning
  5. 2025Reasoning with Latent Thoughts: On the Power of Looped Transformers
  6. 2024Distillation Contrastive Decoding: Improving LLMs Reasoning with Contrastive Decoding and Distillation
  7. 2026Bridging the Gap Between Latent and Explicit Reasoning with Looped Transformers
  8. 2026Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models