CAST optimizes speculative LLM inference by organizing multiple high-scoring token candidates from block drafters into a verification tree. Instead of discarding non-top chains, it verifies them in a single target model pass, leveraging already-computed drafts. The method dynamically adjusts tree width by adding candidates only when the expected performance gain exceeds the computational cost.
- Reuses existing block drafter scores by verifying multiple candidates instead of just the top one.
- Reduces target model passes by packing candidates into a single verification tree structure.
- Requires no changes to target model weights, drafter architecture, or decoding rules.
- Dynamically scales tree width based on cost-benefit analysis of additional candidates.