mlsanityData to 7 Oct 2026

Context-Aware Assistant Selection for Improved Inference Acceleration with Large Language Models

arXiv 2408.08470 ↗First posted 16 Aug 2024cs.LG cs.AIcited by 4

On the map: Efficient LLM inference and serving → Early exit and edge inference

Abstract (arXiv)

Despite their widespread adoption, large language models (LLMs) remain prohibitive to use under resource constraints, with their ever growing sizes only increasing the barrier for use. One noted issue is the high latency associated with auto-regressive generation, rendering large LLMs use dependent on advanced computing infrastructure. Assisted decoding, where a smaller draft model guides a larger target model's generation, has helped alleviate this, but remains dependent on alignment between the two models. Thus if the draft model is insufficiently capable on some domain relative to the target model, performance can degrade. Alternatively, one can leverage multiple draft models to better cover the expertise of the target, but when multiple black-box draft models are available, selecting an assistant without details about its construction can be difficult. To better understand this decision making problem, we observe it as a contextual bandit, where a policy must choose a draft model based on a context. We show that even without prior knowledge of the draft models, creating an offline dataset from only outputs of independent draft/target models and training a policy over the alignment of these outputs can accelerate performance on multiple domains provided the candidates are effective. Further results show this to hold on various settings with multiple assisted decoding candidates, highlighting its flexibility and the advantageous role that such decision making can play.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 27 of its 42 references that are in the map. First posted on arXiv 16 Aug 2024.

Builds on

27 of 42 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2022Training language models to follow instructions with human feedbackcited by 15,712
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2020Scaling Laws for Neural Language Modelscited by 6,411
  6. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  7. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  8. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  9. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  10. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  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
15 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. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
  4. 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 564
  5. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 318
  6. 2024Break the Sequential Dependency of LLM Inference Using Lookahead Decodingcited by 295
  7. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decodingcited by 266
  8. 2022Speculative Decoding: Exploiting Speculative Execution for Accelerating Seq2seq Generationcited by 169
  9. 2023Speculative Decoding with Big Little Decodercited by 163
  10. 2021Instantaneous Grammatical Error Correction with Shallow Aggressive Decodingcited by 53
  11. 2022On the Limitations of Reference-Free Evaluations of Generated Textcited by 52
  12. 2023SPEED: Speculative Pipelined Execution for Efficient Decodingcited by 47
  13. 2023Predictive Pipelined Decoding: A Compute-Latency Trade-off for Exact LLM Decodingcited by 40
  14. 2022FiDO: Fusion-in-Decoder optimized for stronger performance and faster inferencecited by 31
  15. 2023Sorted LLaMA: Unlocking the Potential of Intermediate Layers of Large Language Models for Dynamic Inferencecited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024The Power of Adaptation: Boosting In-Context Learning through Adaptive Prompting
  2. 2025Towards more Contextual Agents: An extractor-Generator Optimization Framework
  3. 2024Generative Adapter: Contextualizing Language Models in Parameters with A Single Forward Pass
  4. 2026Efficiently Aligning Draft Models via Parameter- and Data-Efficient Adaptation
  5. 2025When Life Gives You Samples: The Benefits of Scaling up Inference Compute for Multilingual LLMs
  6. 2024Reference Trustable Decoding: A Training-Free Augmentation Paradigm for Large Language Models
  7. 2025LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing
  8. 2025Learning to Route LLMs from Bandit Feedback: One Policy, Many Trade-offs