arXiv (All)
open access
What Limits Recursive Reasoning Models: Optimization, Architecture and Test-Time Scaling
Recursive reasoning models apply a small shared Transformer block many times to refine a latent state. This gives them large effective depth with few parameters and makes them strong on algorithmic tasks. Such compact solvers are natural candidates for tools that an LLM can call on narrow algorithmi
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
- What Limits Recursive Reasoning Models: Optimization, Architecture and Test-Time Scaling#1136886
- MathDuels: Evaluating LLMs as Problem Posers and Solvers#126578
- TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs#986889
- What Survives When You Compress a Recursive Reasoner for the Edge?#1143818
- PlanarBench: Evaluating LLM Spatial Reasoning via Planar Graph Drawing#820492
Record · ID 1145134
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