mlsanityData to 7 Oct 2026

BiTA: Bi-Directional Tuning for Lossless Acceleration in Large Language Models

arXiv 2401.12522 ↗First posted 23 Jan 2024cs.CL cs.AI cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) commonly employ autoregressive generation during inference, leading to high memory bandwidth demand and consequently extended latency. To mitigate this inefficiency, we present Bi-directional Tuning for lossless Acceleration (BiTA), an innovative method expediting LLMs via streamlined semi-autoregressive generation and draft verification. Inspired by the concept of prompt tuning, we enhance LLMs with a parameter-efficient design called bi-directional tuning for the capability in semi-autoregressive generation. Employing efficient tree-based decoding, the models perform draft candidate generation and verification in parallel, ensuring outputs identical to their autoregressive counterparts under greedy sampling. BiTA serves as a lightweight plug-in module, seamlessly boosting the inference efficiency of existing LLMs without requiring additional assistance models or incurring significant extra memory costs. Applying the proposed BiTA, LLaMA-2-70B-Chat achieves a 2.7× speedup on the MT-Bench benchmark. Extensive experiments confirm our method surpasses state-of-the-art acceleration techniques.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 35 of its 48 references that are in the map. First posted on arXiv 23 Jan 2024.

Builds on

35 of 48 references.

References · 35

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  5. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  6. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  7. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  8. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  9. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  10. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
  11. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
  12. 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,308
23 more
  1. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 975
  2. 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
  3. 2021GPT Understands, Toocited by 715
  4. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
  5. 2023Instruction Tuning with GPT-4cited by 676
  6. 2018Rethinking the Value of Network Pruningcited by 595
  7. 2023The Falcon Series of Open Language Modelscited by 526
  8. 2017Non-Autoregressive Neural Machine Translationcited by 457
  9. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  10. 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generationcited by 169
  11. 2023Accelerating LLM Inference with Staged Speculative Decodingcited by 151
  12. 2023Platypus: Quick, Cheap, and Powerful Refinement of LLMscited by 150
  13. 2023REST: Retrieval-Based Speculative Decodingcited by 148
  14. 2023SpecTr: Fast Speculative Decoding via Optimal Transportcited by 129
  15. 2023Accelerating Transformer Inference for Translation via Parallel Decodingcited by 123
  16. 2023Online Speculative Decodingcited by 109
  17. 2023Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systemscited by 101
  18. 2020Fully Non-autoregressive Neural Machine Translation: Tricks of the Tradecited by 99
  19. 2022A Survey on Non-Autoregressive Generation for Neural Machine Translation and Beyondcited by 64
  20. 2023PaSS: Parallel Speculative Samplingcited by 49
  21. 2018Semi-Autoregressive Neural Machine Translationcited by 48
  22. 2023SPEED: Speculative Pipelined Execution for Efficient Decodingcited by 47
  23. 2022Directed Acyclic Transformer for Non-Autoregressive Machine Translationcited by 44

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 4; 2026: 6.

13 papers.

Sort:

By area: