arXiv (All)
open access
Shared Phase and Retention Control for Efficient Adaptive Spectral Recurrence
As new evidence arrives, a sequence model must update what it remembers and how memory influences predictions. While Transformers incur computation and cache costs scaling with context length, fixed-state recurrent models offer constant-memory inference. However, linear and spectral recurrences trad
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
- Where Does Staleness Accumulate? Pool Aware Effective Staleness Control for Asynchronous RL in LLM Post-Training#1132031
- PEARL: Adaptive Prefill-Decode Execution with Elasticity for Agentic Reinforcement Learning#1129755
- Compositional Spectral Prompts for LLM-based Online Time Series Forecasting#822495
- Decoding Looped Transformers Better for (Almost) Free#1161021
- Decoding Looped Transformers Better for (Almost) Free#1157533
Record · ID 1144049
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