arXiv (All)
open access
Distilling Sequential Computation in Transformer Language Models
Transformer language models process sequences token by token in an autoregressive manner, making growing contexts increasingly expensive. Yet many adjacent token spans are highly predictable or frequently occur as stable units, suggesting that their representations may be compressible. We introduce
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
- Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers#432586
- RoPE is Dead, Long Live RoPE: Towards Scalable Data-aware Positional Encodings#1128821
- The KV Cache Working Set: Online Capacity Planning for LLM Inference Systems#1064290
- Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models#1130188
- Toppling the Hierarchy in Byte-level Language Modeling#819909
Record · ID 1063444
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