Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2411.00841

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2411.00841 (cs)
[Submitted on 30 Oct 2024 ]

Title: A Theoretical Perspective for Speculative Decoding Algorithm

Title: 一种推测解码算法的理论视角

Authors:Ming Yin, Minshuo Chen, Kaixuan Huang, Mengdi Wang
Abstract: Transformer-based autoregressive sampling has been the major bottleneck for slowing down large language model inferences. One effective way to accelerate inference is \emph{Speculative Decoding}, which employs a small model to sample a sequence of draft tokens and a large model to validate. Given its empirical effectiveness, the theoretical understanding of Speculative Decoding is falling behind. This paper tackles this gap by conceptualizing the decoding problem via markov chain abstraction and studying the key properties, \emph{output quality and inference acceleration}, from a theoretical perspective. Our analysis covers the theoretical limits of speculative decoding, batch algorithms, and output quality-inference acceleration tradeoffs. Our results reveal the fundamental connections between different components of LLMs via total variation distances and show how they jointly affect the efficiency of decoding algorithms.
Abstract: 基于Transformer的自回归采样是导致大型语言模型推理变慢的主要瓶颈。 一种有效加速推理的方法是\emph{推测解码},它使用一个小模型来采样一系列草稿标记,然后使用一个大模型进行验证。 鉴于其经验上的有效性,对推测解码的理论理解却滞后了。 本文通过马尔可夫链抽象来概念化解码问题,并从理论角度研究关键属性,\emph{输出质量和推理加速}。 我们的分析涵盖了推测解码的理论极限、批处理算法以及输出质量与推理加速之间的权衡。 我们的结果揭示了通过总变异距离的不同组件之间的基本联系,并展示了它们如何共同影响解码算法的效率。
Comments: NeurIPS 2024
Subjects: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (stat.ML)
Cite as: arXiv:2411.00841 [cs.LG]
  (or arXiv:2411.00841v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2411.00841
arXiv-issued DOI via DataCite

Submission history

From: Ming Yin [view email]
[v1] Wed, 30 Oct 2024 01:53:04 UTC (1,132 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2024-11
Change to browse by:
cs
cs.AI
cs.CL
stat
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号