Human Feedback Types
provisional (inferred)None explicit
No explicit feedback protocol extracted.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
HFEPX · Eval paper review
Zihong Zhang, Zuchao Li, Lefei Zhang, Ping Wang +1 more
Published
Apr 16, 2026
Citations
0
Trust level
Provisional
Usefulness score
Unavailable
Extraction confidence
0% (Provisional)
Derived from abstract and metadata only.
Signals refreshed
Apr 16, 2026
Signal extraction is still processing. This page currently shows metadata-first guidance until structured protocol fields are ready.
This page is a lightweight research summary built from the abstract and metadata while deeper extraction catches up.
All signals on this page are inferred from the abstract only and may be inaccurate. Do not use this page as a primary protocol reference.
Best use
Background context only
Use if you need
A provisional background reference while structured extraction finishes.
What to verify
Read the full paper before copying any benchmark, metric, or protocol choices.
Main weakness
This page is still relying on abstract and metadata signals, not a fuller protocol read.
Eval-fit score is unavailable until extraction completes.
If you are doing eval pipeline work, start here
Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency. Speculative decoding (SD) mitigates this through a guess-and-verify strategy, but existing training-free variants face trade-offs: retrieval-based drafts break when no exact match exists, while logits-based drafts lack structural guidance. We propose $\textbf{RACER}$ ($\textbf{R}$etrieval-$\textbf{A}$ugmented $\textbf{C}$ont$\textbf{e}$xtual $\textbf{R}$apid Speculative Decoding), a lightweight and training-free method that integrates retrieved exact patterns with logit-driven future cues. This unification supplies both reliable anchors and flexible extrapolation, yielding richer speculative drafts. Experiments on Spec-Bench, HumanEval, and MGSM-ZH demonstrate that RACER consistently accelerates inference, achieving more than $2\times$ speedup over autoregressive decoding, and outperforms prior training-free methods, offering a scalable, plug-and-play solution for efficient LLM decoding. Our source code is available at $\href{https://github.com/hkr04/RACER}{https://github.com/hkr04/RACER}$.
These are the protocol signals we could actually recover from the available paper metadata. Use them to decide whether this paper is worth deeper reading.
None explicit
No explicit feedback protocol extracted.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
None explicit
Validate eval design from full paper text.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
Not reported
No explicit QC controls found.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
Not extracted
No benchmark anchors detected.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
Not extracted
No metric anchors detected.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
Unknown
Rater source not explicitly reported.
"Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency."
This page is using abstract-level cues only right now. Treat the signals below as provisional.
Evaluation fields are inferred from the abstract only.
Autoregressive decoding in Large Language Models (LLMs) generates one token per step, causing high inference latency.
Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.