Skip to main content

Input-Conditioned Search for Efficient Test-Time Scaling of Recursive Reasoners

Haochen Shi, Tianwen Fu, Qianggang Ding, Yinhan Lu, Yizhan Li, Huan Zhang, Yajie Zhao, Xingdi Yuan, Hengyang Lu, Bang Liu

Searches over input conditions to change a recursive reasoner's update rule without retraining it. Tests whether these alternative updates can redirect a trajectory away from an incorrect solution, rather than only adding more steps or perturbing its state.

First public: · Added to this list: October 18, 2026

Cite this paper

ArXiv preprint

arXiv:2610.18547 · Initial submission: 2026-10-13

BibTeX · CSL-JSON

A published-version citation has not been verified for this entry. This does not mean the paper is unpublished.

Choose the version you used. The arXiv link may serve a revision; check the original paper for the exact result, assumptions and limitations you cite.

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.

Read or reuse this entry

Plain-text Markdown · JSON record · Find in the full list

Our summary and categories are a reading aid, not the authors’ abstract. Use the original paper for research claims. Suggest a correction.