---
title: "Only Accepted Tokens Count: An Energy Accounting of Speculative Decoding Under Latency Targets"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2610.40287v1"
permalink: "https://feed.astralor.com/items/itm_150770ec317a4776dcf4d648"
published: "2026-10-29T15:37:45.000Z"
score: 58
channel: "tech"
tags: ["LLM","推理效率","Only Accepted Tokens","Count","Energy Accounting","Speculative Decoding Under","Latency Targets Large","Energy"]
---

# Only Accepted Tokens Count: An Energy Accounting of Speculative Decoding Under Latency Targets

## 速览

Large language model serving is limited by facility power. Energy per token determines how many tokens a datacenter can serve, while a latency target bounds how quickly each user receives them. During decode, every weig…

## 关键点

- Large language model serving is limited by facility power.
- Energy per token determines how many tokens a datacenter can serve, while a latency target bounds how quickly each user receives them.
- During decode, every weight is read from memory for every generated token.

## 全文

Large language model serving is limited by facility power. Energy per token determines how many tokens a datacenter can serve, while a latency target bounds how quickly each user receives them. During decode, every weight is read from memory for every generated token. Batching amortizes this read across users but makes no individual user faster. Speculative decoding does: a drafter proposes several future tokens, and the target model verifies them in a single forward pass that reuses the same weight read. Because every drafted token must be verified whether or not it is accepted, the energy speculation saves depends on how many drafted tokens are accepted. This saving is hard to pin down. It varies across target models from different attention families and across drafting schemes, and it depends on the text being served. Every drafter we evaluate accepts fewer tokens on conversation than on code, and every trained drafter accepts fewer on Romansh, a low-resource language, than on English. We measure speculative decoding under production serving conditions (SGLang, CUDA graphs enabled) on H100 and H200 GPUs, at batch sizes up to 64 across 5 corpora. On dense models, verification, not drafting, dominates the energy cost. The saving shrinks as the batch grows, because batching has already shared the weight read that speculation would divide among the accepted tokens. At large batch sizes, block drafters push verification past the balance point between arithmetic and memory traffic into the compute-bound regime, where the saving becomes a loss, and a drafter with low acceptance raises energy per token. Meeting a tighter latency target with speculation then costs additional energy. Larger batches lower energy per token without speculation. Speculation adds to that saving only when acceptance is high, and on the model we tested it leaves little headroom for latency-preserving DVFS.

---

引用前请核对原文;本文由星际流动整理:https://feed.astralor.com/items/itm_150770ec317a4776dcf4d648