mlsanityData to 7 Oct 2026

Amphista: Bi-directional Multi-head Decoding for Accelerating LLM Inference

arXiv 2406.13170 ↗First posted 19 Jun 2024cs.AI cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) inherently use autoregressive decoding, which lacks parallelism in inference and results in significantly slow inference speed. While methods such as Medusa constructs parallelized heads, they lack adequate information interaction across different prediction positions. To overcome this limitation, we introduce Amphista, an enhanced speculative decoding framework that builds upon Medusa. Specifically, Amphista models an Auto-embedding Block capable of parallel inference, incorporating bi-directional attention to enable interaction between different drafting heads. Additionally, Amphista integrates Staged Adaptation Layers, which ensure a seamless transition of semantic information from the target model's autoregressive inference to the drafting heads' non-autoregressive inference, effectively achieving paradigm shift and feature fusion. Experimental results on Vicuna models using MT-Bench and Spec-Bench demonstrate that Amphista achieves substantial acceleration while maintaining generation quality. On MT-Bench, Amphista delivers up to 2.75× speedup over vanilla autoregressive decoding and 1.40× over Medusa on Vicuna 33B in wall-clock time.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 32 of its 42 references that are in the map. First posted on arXiv 19 Jun 2024.

Builds on

32 of 42 references.

References · 32

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  3. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  4. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  5. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  6. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  7. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  8. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  9. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  10. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
  11. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,308
  12. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
20 more
  1. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 975
  2. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 821
  3. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 564
  4. 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
  5. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verificationcited by 359
  6. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  7. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
  8. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decodingcited by 295
  9. 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 289
  10. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decodingcited by 266
  11. 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
  12. 2023Speculative Decoding with Big Little Decodercited by 163
  13. 2024Sequoia: Scalable, Robust, and Hardware-aware Speculative Decodingcited by 103
  14. 2023Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decodingcited by 80
  15. 2024GliDe with a CaPE: A Low-Hassle Method to Accelerate Speculative Decodingcited by 74
  16. 2024Kangaroo: Lossless Self-Speculative Decoding via Double Early Exitingcited by 58
  17. 2024Lossless Acceleration of Large Language Model via Adaptive N-gram Parallel Decodingcited by 21
  18. 2024ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decodingcited by 12
  19. 2024Clover: Regressive Lightweight Speculative Decoding with Sequential Knowledgecited by 10
  20. 2024Exploring and Improving Drafts in Blockwise Parallel Decodingcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding
  2. 2025Scaling LLM Speculative Decoding: Non-Autoregressive Forecasting in Large-Batch Scenarios
  3. 2025AdaSD: Adaptive Speculative Decoding for Efficient Language Model Inference
  4. 2025Accelerating LLM Inference with Lossless Speculative Decoding Algorithms for Heterogeneous Vocabularies
  5. 2024Towards Fast Multilingual LLM Inference: Speculative Decoding and Specialized Drafters
  6. 2026SpecBound: Adaptive Bounded Self-Speculation with Layer-wise Confidence Calibration
  7. 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding
  8. 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding