Yuchen Xian, Yang He, Yunqiu Xu, Yi Yang
4 min
Abstract
Speculative decoding (SD) addresses the high inference costs of LLMs by having lightweight drafters generate candidates for large verifiers to validate in parallel. Existing draft-verify methods use binary decisions: accept or fully recompute. Yet we find that many rejected tokens can be verified correctly by a slim submodel derived from the full verifier via intra-model routing, instead of the full verifier. This motivates our slim-verifier to handle tokens requiring moderate verification resources, reducing expensive large-model calls. We propose Verification via Intra-Model Routing for Speculative Decoding (VIA-SD), a multi-tier framework using a routed slim-verifier. Draft tokens are processed hierarchically: direct acceptance for high-confidence cases, slim-verifier regeneration for medium-confidence cases, and full-model verification for uncertain cases. Across four representative tasks and multiple model families, VIA-SD reduces rejection rates by 0.10-0.22 and delivers 10-20% speedups over strong SD baselines, while achieving 2.5-3x acceleration over non-drafting decoding. Moreover, VIA-SD is compatible with existing SD frameworks without modifying their training procedures. Our results suggest multi-tier SD as a general paradigm for scalable and efficient LLM inference. Project page: https://zju-xyc.github.io/VIA-SD-Project-Page/
Sam: So it's like a disagreement meter. A small disagreement means the slim verifier can sort it out. A large disagreement means escalate to the top.
Alex: That's a precise way to describe it. And because this check happens automatically for every single word the system generates, the routing is continuous and dynamic — not a one-time decision at the start of a task.
Sam: So you end up with three tiers: the small draft model, the slim verifier for moderate cases, and the full model only for the genuinely hard ones.
Alex: Exactly. And the practical consequence is that the full model gets called on far less often. The paper suggests this reduces what they call the "rejection rate" — the frequency with which drafts get thrown out and reprocessed — by up to twenty-two percent compared to existing methods. That translates into meaningful speedups without a measurable drop in the quality of the output.
Sam: It's a bit like how a well-run organisation works. Most decisions are handled at the team level, some go to a manager, and only the genuinely consequential ones reach the top.
Alex: That's a fair comparison. The underlying insight is that not all problems are equally hard, and treating them as if they are wastes resources. By building a system that can distinguish between routine, moderate, and genuinely difficult cases — and route each one appropriately — the researchers show it's possible to maintain accuracy while using significantly less computational energy. It's a practical contribution to a real bottleneck in how these models are deployed.
Sam: And given how much energy large AI systems consume, finding ways to do more with less seems like a worthwhile direction.
Alex: The paper makes a reasonable case that it is. Thanks for listening to ResearchPod.