arXiv (All)
open access
Linear RNN Scaling Laws: When Longer Sequences Beat More Sequences
Empirical scaling laws for autoregressive language models relate prediction loss to model size, data size, and optimization compute, but their theoretical origin is still poorly understood in sequential pretraining settings. We study this question in a tractable teacher--student model where a stable
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
- Amortizing intractable inference in large language models#798540
- Amortizing intractable inference in large language models#797127
- Pretraining Recurrent Networks without Recurrence#259457
- Time-LLM: Time Series Forecasting by Reprogramming Large Language Models#16584
- Any-Order GPT as Masked Diffusion Model: Decoupling Formulation and Architecture#820214
Record · ID 1064508
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