arXiv (All)
open access
Log-Depth Recurrent Language Modeling
Language modeling using Transformers has become commonplace despite their fixed computational depth and quadratic runtime with respect to input tokens. Recurrent models on the other hand offer linear depth but no parallel execution. In this work, we extend balanced-tree recursive operators from sequ
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
- Distilling Sequential Computation in Transformer Language Models#1063444
- WaveTLM: Reliable Time-Series Language Modeling through Task Compilation#1012973
- WaveTLM: Reliable Time-Series Language Modeling through Task Compilation#965417
- Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models#1130188
- Trading Depth for Time in Recurrent Transformers#1036001
Record · ID 1064756
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