arXiv (All)
open access
Preserving Updates in Low-Bit Recurrent State Quantization
Linear attention and recurrent models compress past tokens into a fixed-size state that is updated at every step. However, storing these states in high precision incurs substantial memory and bandwidth costs at large batch sizes, motivating low-bit state quantization. Unlike weights and key--value c
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
- Gated DeltaNet-2: Decoupling Erase and Write in Linear Attention#219364
- Gated DeltaNet-2: Decoupling Erase and Write in Linear Attention#216854
- Kathleen Remembers: Length-Invariant One-Shot Recall Without Attention#799582
- Kathleen Remembers: Length-Invariant One-Shot Recall Without Attention#798159
- Generalization behavior of OPTQ and the role of regularization#1106259
Record · ID 1326959
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