arXiv (All)
open access
GDN Tree-Scan: Served Tree Verification for Recurrent-Hybrid Language Models
Tree speculative decoding verifies multiple candidate continuations in one target forward pass. For attention-only transformers, the verifier mainly needs an ancestry mask. Recurrent-hybrid language models break this assumption: a candidate row must also carry the recurrent state that native sequent
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
- The Mask Is Not the Model: Auditing Prefix Invariance in Attention, State-Space, and Hybrid Sequence Models#1118695
- ConvergeFlow: Language Flow with Provable Convergence to Token Embeddings#482110
- Switching Linear Attention#1144001
- Repurposing Pre-trained LLMs as High Fidelity Continuous Text Autoencoders#1063459
- HyperGuide: Hyperbolic Guidance for Efficient Multi-Step Reasoning in Large Language Models#1155211
Record · ID 1050091
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