Lune

NeurIPS2025顶会

AutoJudge: Judge Decoding Without Manual Annotation

Roman Garipov, Fedor Velikonivtsev, Ivan Ermakov, Ruslan Svirschevski, Vage Egiazarian, Max Ryabinin

2025年份
14被引次数
3顶会引用

摘要

We introduce AutoJudge 1 , a method that accelerates large language model (LLM) inference with task-specific lossy speculative decoding. Instead of matching the original model output distribution token-by-token, we identify the generated tokens that affect the downstream quality of the response, relaxing the distribution match guarantee so that the "unimportant" tokens can be generated faster. Our approach relies on a semi-greedy search algorithm to test which of the mismatches between target and draft models should be corrected to preserve quality and which ones may be skipped. We then train a lightweight classifier based on existing LLM embeddings to predict, at inference time, which mismatching tokens can be safely accepted without compromising the final answer quality. We evaluate AutoJudge with multiple draft/target model pairs on mathematical reasoning and programming benchmarks, achieving significant speedups at the cost of a minor accuracy reduction. Notably, on GSM8K with the Llama 3.1 70B target model, our approach achieves up to ≈2× speedup over speculative decoding at the cost of a ≤1% drop in accuracy. When applied to the LiveCodeBench benchmark, AutoJudge automatically detects programming-specific important tokens, accepting ≥25 tokens per speculation cycle at a 2% drop in Pass@1. Our approach requires no human annotation and is easy to integrate with modern LLM inference frameworks.

  • For greedy decoding, it checks that the drafted tokens are the same as the target model's own next token predictions. For sampling, it uses a procedure that matches the sampling probabilities [Leviathan et al., 2023].

  • For notation simplicity, we assume that the GENERATE(•, •) function can be called with a prefix of a response. In that case, we assume that the total response length (and not just newly generated tokens) does not exceed Tmax, so that the response cannot grow indefinitely with each subsequent replacement.

  • More precisely, find the fastest-to-generate sequence, accounting for the differences in response length.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

lune papers fulltext 9bddc110-a3d8-4627-9cd4-e664acd0d46f

引用它的顶会 Paper3

问问它们各自怎么用它

它引用的顶会 Paper20

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖