arXiv (All)
open access
Shallow Queries, Mature Values: Depth-Asynchronous Self-Speculation for Looped Transformers
Looped Transformers reuse a shared block across recurrent depths, making autoregressive decoding expensive because every generated token requires many sequential recurrent passes. Self-speculative decoders reduce this cost by drafting at an early depth and verifying at full depth, but typically bind
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
- Trading Depth for Time in Recurrent Transformers#1036001
- Rethinking Pairwise Token Interaction in Spiking Transformers#1062196
- How Does mHC Use Its Residual Streams? Selective Routing and Near-Identity Mixing#660800
- TIDE: Temporal Incremental Draft Engine for Self-Improving LLM Inference#1076809
- Train Where the Quantized Model Goes: On-Policy Distillation for Low-Bit Reasoning#1062594
Record · ID 1128804
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