arXiv (All)
open access
When Recursive Models Finish Computing
Recursive models can continue updating their latent states beyond their nominal inference budget, so an incorrect output at that budget does not show whether computation is unfinished or has entered a persistently unsuccessful regime. We study the dynamics of completion in attention- and MLP-based T
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
- When Recursive Models Finish Computing#1043102
- Is Completeness Necessary? Estimation in Nonidentified Linear Models#1000651
- Updating incoherent credences ‐ Extending the Dutch strategy argument for conditionalization#718843
- Computational modeling of fixation durations reveals that global inhibition is necessary to explain individual differences in gaze behavior during reading#355554
- TTT-TP: Regularized Target Propagation for Multi-Layer Test-Time Learners#1079178
Record · ID 1062378
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