arXiv (All)
open access
Scheduling Recursive Reasoning in Looped Transformers
Recurrent reasoning models have attracted growing attention for scaling test-time computation, typically by iteratively refining latent states with shared parameters. However, these models apply each learned update with a fixed unit scale, which can be conservative when updates make persistent progr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improving Test-Time Scaling with Adaptive Looped Transformers#1130395
- Improving Test-Time Scaling with Adaptive Looped Transformers#1108746
- TTHE: Test-Time Harness Evolution#353120
- NeuralCert: certified computational discovery of extremal mathematical constructions#1104495
- Zero-shot generalization of transformer neural operators to larger domains#1156388
Record · ID 1131854
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive