arXiv (All)
open access
Trading Depth for Time in Recurrent Transformers
Recurrent Transformers increase computational depth through temporal recurrence, feeding each token's high-level hidden state into the computation of the next. This raises a natural question: is additional computation better spent on more temporal steps or greater physical depth? We investigate this
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
- Why and When Deep is Better than Shallow: Implementation-Agnostic State-Transition Model of Deep Learning#1116102
- LSTM-UT and Recurrent-Depth Transformers on Cellular Automata#1014115
- Log-Depth Recurrent Language Modeling#1064756
- Placement Is Free, Composition Is Not: The Latin Square as a Provably-Balanced Construction for Heterogeneous Sequence-Mixer Stacks#1034037
- Shallow Queries, Mature Values: Depth-Asynchronous Self-Speculation for Looped Transformers#1128804
Record · ID 1036001
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