Fast Inference from Transformers via Speculative Decoding

Inference from large autoregressive models like Transformers is slow - decoding K tokens takes K serial runs of the model. In this work we introduce speculative decoding - an algorithm to sample from autoregressive models faster without any changes to the outputs, by computing several tokens in para...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Leviathan, Yaniv, Kalman, Matan, Matias, Yossi
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 18.05.2023
Subjects
Algorithms
Approximation
Autoregressive models
Inference
Sampling methods
Transformers
Online AccessGet full text

Cover

More Information
Summary:Inference from large autoregressive models like Transformers is slow - decoding K tokens takes K serial runs of the model. In this work we introduce speculative decoding - an algorithm to sample from autoregressive models faster without any changes to the outputs, by computing several tokens in parallel. At the heart of our approach lie the observations that (1) hard language-modeling tasks often include easier subtasks that can be approximated well by more efficient models, and (2) using speculative execution and a novel sampling method, we can make exact decoding from the large models faster, by running them in parallel on the outputs of the approximation models, potentially generating several tokens concurrently, and without changing the distribution. Our method can accelerate existing off-the-shelf models without retraining or architecture changes. We demonstrate it on T5-XXL and show a 2X-3X acceleration compared to the standard T5X implementation, with identical outputs.
ISSN:2331-8422