Skip to main content

When Does Adaptive Halting Win? Selection Rules Matter in Looped Language Models

Mahesh Reddy Pagadala

Compares learned and untrained stopping rules on a frozen looped language model. Changing how the stopping threshold is chosen reverses which method saves more loops. Finds no demonstrated advantage for a trained probe over a simple KL-based rule; savings are estimated from stored loop traces.

First public: · Added to this list: November 3, 2026

Cite this paper

ArXiv preprint

arXiv:2611.02333 · Initial submission: 2026-11-02

BibTeX · CSL-JSON

Explore this approach

Recurrent reasoning — Repeat parts of the model or keep intermediate information in memory while working through a problem. Some methods also learn how many passes to run.

Analysis and evaluation — Measure how well these methods work, investigate what their internal computation does, and identify where they fail. This includes experiments, studies of model internals, and mathematical results.