arXiv (All)
open access
Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing
Speculative decoding accelerates LLM inference by having a lightweight draft model propose speculative windows of candidate tokens for parallel verification by a larger target model. In practice, speculative efficiency is often bottlenecked by hard-to-draft positions, where an early mismatch truncat
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
- TreeSpark: Learning to Draft the Trees You Verify for Speculative Decoding#1355107
- LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter#1132230
- JetSpec: Breaking the Scaling Ceiling of Speculative Decoding with Parallel Tree Drafting#1117472
- NebulaSD: Many-for-Many Speculative Decoding#1108689
- NebulaSD: Many-for-Many Speculative Decoding#1077293
Record · ID 1411785
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