Looped Transformers achieve dramatic parameter efficiency by repeatedly executing a single shared block across recurrent cycles. However, standard autoregressive decoding discards all intermediate recurrent states, utilizing only the final pass. Researchers from UT Austin, Princeton, and collaborators introduce LoopCD, a training-free contrastive decoding framework. By contrasting final recurrent predictions with early-stage weaker passes in logit space (LoopCD-Logits) or hidden space with zero output pass overhead (LoopCD-Hidden), LoopCD raises Ouro-2.6B-Thinking's AIME 2024 Pass@1 from 61.88% to 73.33% and Huginn's HumanEval Pass@1 from 22.56% to 31.71%. Crucially, LoopCD allows halving recurrent loops while outperforming full-depth unguided baselines, reducing forward FLOPs by 22.5% to 48.2%.
Key Takeaways
- ✓Introduces LoopCD for looped transformers, turning discarded intermediate states into zero-cost contrastive guidance
- ✓Drives Ouro-2.6B-Thinking AIME 2024 Pass@1 from 61.88% to 73.33% and lifts Huginn HumanEval from 22.56% to 31.71%
- ✓Enables halving recurrent loop counts while outperforming full-depth baselines, slashing forward FLOPs by 22.5% to 48.2%

Turn your technical choice into a development budget
Compare 40 dev plans & simulate token costs vs $20/mo subscriptions
Project Links & Resources
Direct AccessIn-Depth Technical Analysis
Background and the Problem
Looped Transformers achieve exceptional parameter efficiency by recurrently iterating a single shared block across multiple loops, emulating deep architectures within a fraction of memory footprints. However, standard decoding utilizes exclusively the final loop's hidden representation, discarding all intermediate states. Traditional contrastive decoding requires maintaining a distinct smaller amateur model in memory, which doubles VRAM usage and kernel dispatch overhead.
Architecture and How It Works
LoopCD exploits the inherent computational progression of looped recurrence to perform training-free contrastive decoding:
- Natural Internal Weak-Strong Pairing: Early recurrent passes represent weaker internal states of the exact same model, supplying aligned amateur representations without extra models.
- Dual Decoding Variants: Implements LoopCD-Logits (contrasting final logits against early loops with minimal projection cost) and LoopCD-Hidden (operating directly in latent vector space with zero extra output head passes).
- Recurrent Loop Pruning: Guided search enables the model to reach superior consensus with substantially fewer recurrent cycles.
Benchmarks and Measured Results
Evaluated across four looped Transformer architectures on challenging math and code benchmarks:
- AIME 2024 Surges to 73.33%: LoopCD-Logits elevates Ouro-2.6B-Thinking's Pass@1 from 61.88% to 73.33% (+11.45 percentage points).
- HumanEval Coding Gains: LoopCD-Hidden boosts Huginn's code generation Pass@1 from 22.56% to 31.71% at zero extra projection overhead.
- 22.5% to 48.2% FLOPs Reduction: Halving the loop count under LoopCD still matches or exceeds full-depth baselines, cutting forward FLOPs by up to 48.2%.
Getting Started for Developers
LoopCD requires zero parameter updates and drops seamlessly into Hugging Face and vLLM generate loops. Engineers deploying lightweight recurrent foundation models on edge devices can achieve immediate latency reductions alongside double-digit accuracy gains.
Benchmark side-by-side against alternatives, or calculate monthly token cost vs subscription break-even.
Discussion & Comments
0Sign in to join the discussion
Connect with AI developers to exchange benchmark insights.