---
title: "LoopCD Cuts AI Reasoning Costs by 48% Without Changing Model Weights"
subtitle: "A new training-free decoding trick for looped transformers contrasts early and late recurrent passes, boosting accuracy and cutting compute nearly in half."
url: "https://alphasignal.ai/news/loopcd-cuts-ai-reasoning-costs-by-48-without-changing-model-weights"
author: "AlphaSignal Newsroom"
author_url: "https://alphasignal.ai/editorial-team"
company: "AlphaSignal"
company_url: "https://alphasignal.ai/company/alphasignal"
published: "2026-10-01T17:58:38.000Z"
updated: "2026-10-02T12:07:32.310Z"
type: "Paper"
topics:
  - "Reasoning"
  - "Infra"
subtopics:
  - "Test Time Compute"
  - "Inference Optimization"
upvotes: 535
source_url: "https://arxiv.org/abs/2610.02185"
comments: 0
truncated: true
---

# LoopCD Cuts AI Reasoning Costs by 48% Without Changing Model Weights

> A new training-free decoding trick for looped transformers contrasts early and late recurrent passes, boosting accuracy and cutting compute nearly in half.

# LoopCD Reuses Early Loops to Improve Transformer Decoding

Looped transformers reuse a shared block across recurrent iterations, increasing computational depth without adding a new set of weights at every step. Weihao Liu, Ruixiang Zhang, and collaborators propose [LoopCD](https://arxiv.org/abs/2610.02185), a training-free decoding method that turns those iterations into a built-in contrastive signal. The authors, who completed part of the work during an Apple internship, report higher reasoning accuracy and forward-FLOP reductions of 22.5% to 48.2% when using fewer loops.

During ordinary inference, each recurrent iteration produces a hidden state that the model could map to next-token scores, or logits. Standard decoding uses the final state and discards the earlier predictions. LoopCD instead treats the first iteration as a weak predictor and the final iteration as a strong predictor, eliminating the auxiliary model that conventional contrastive decoding often requires.

## One recurrent block, two predictors

LoopCD adjusts token scores by emphasizing the difference between the final and first recurrent states. Tokens that remain strong after additional computation receive more weight, while candidates favored mainly by the early iteration lose ground.

| Variant           | Where contrast happens | Additional output-stack calls | Main trade-off                            |
| ----------------- | ---------------------- | ----------------------------- | ----------------------------------------- |
| **LoopCD-Logits** | Vocabulary logits      | One per generated token       | Applies contrast directly to token scores |
| **LoopCD-Hidden** | Hidden states          | None                          | Adds state storage and a vector operation |

Both variants follow the same schematic update, with `alpha` controlling contrast strength:

```
Logit contrast:  z_cd = z_final + alpha * (z_final - z_first)
Hidden contrast: h_cd = h_final + alpha * (h_final - h_first)
```

In the logit variant, the model runs its output stack on both states before combining their vocabulary scores. In the hidden-state variant, it combines the states first and sends the result through the coda and language-modeling head once. The coda comprises any post-loop layers, while the language-modeling head maps the resulting vector to one score per vocabulary token.

_Preview only. Full text requires an AlphaSignal Pro account._

## Sources

- [Decoding Looped Transformers Better for (Almost) Free](https://arxiv.org/abs/2610.02185)
- [Decoding Looped Transformers Better for (Almost) Free (HTML)](https://arxiv.org/html/2610.02185)
- [Looped Transformers are Better at Learning Learning Algorithms](https://arxiv.org/abs/2311.12424)