mlsanityData to 14 Oct 2026

AHASD: Asynchronous Heterogeneous Architecture for LLM Adaptive Drafting Speculative Decoding on Mobile Devices

arXiv 2604.25326 ↗First posted 28 Apr 2026cs.AR cs.AIcited by 2

On the map: Efficient LLM inference and serving → Speculative decoding

Abstract (arXiv)

Speculative decoding enhances the inference efficiency of large language models (LLMs) by generating drafts using a small draft language model (DLM) and verifying them in batches with a large target language model (TLM). However, adaptive drafting inference on a mobile single-NPU-PIM system faces idle overhead in traditional operator-level synchronous execution and wasted computation in asynchronous execution due to fluctuations in draft length. This paper introduces AHASD, a task-level asynchronous mobile NPU-PIM heterogeneous architecture for speculative decoding. Notably, AHASD achieves parallel drafting on the PIM and verification on a single NPU through task-level DLM-TLM decoupling and specifically, it incorporates Entropy-History-Aware Drafting Control and Time-Aware Pre-Verification Control to dynamically manage adaptive drafting algorithm execution and pre-verification timing, suppressing invalid drafting based on low-confidence drafts. Additionally, AHASD integrates Attention Algorithm Units and Gated Task Scheduling Units within LPDDR5-PIM to enable attention link localization and sub-microsecond task switching on the PIM side. Experimental results for different LLMs and adaptive drafting algorithms show that AHASD achieves up to 4.2× in throughput and 5.6× in energy efficiency improvements over a GPU-only baseline, and 1.5× in throughput and 1.24× in energy efficiency gains over the state-of-the-art GPU+PIM baseline, with hardware overhead below 3% of the DRAM area.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 8 of its 28 references that are in the map. First posted on arXiv 28 Apr 2026.

Builds on

8 of 28 references.

Closest ancestors · 7

Same direction, newest first

  1. 2025BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms21 May
  2. 2024AdaEDL: Early Draft Stopping for Speculative Decoding of Large Language Models via an Entropy-based Lower Bound on Token Acceptance Probability24 Oct
  3. 2024AMUSD: Asynchronous Multi-Device Speculative Decoding for LLM Acceleration22 Oct
  4. 2024PEARL: Parallel Speculative Decoding with Adaptive Draft Length13 Aug
  5. 2024Decoding Speculative Decoding2 Feb
  6. 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification16 May
  7. 2022Fast Inference from Transformers via Speculative Decoding30 Nov

Other references · 1

  1. 2024NeuPIMs: NPU-PIM Heterogeneous Acceleration for Batched LLM Inferencingcited by 52

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026MemSpec: Memory-Aware Runtime for Adaptive Draft Scheduling in Speculative Decoding on Edge Devices
  2. 2025DuoDecoding: Hardware-aware Heterogeneous Speculative Decoding with Dynamic Multi-Sequence Drafting
  3. 2025OmniDraft: A Cross-vocabulary, Online Adaptive Drafter for On-device Speculative Decoding
  4. 2024AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures
  5. 2025Automatic Task Detection and Heterogeneous LLM Speculative Decoding
  6. 2026AdaptiveSD A Stability-Aware, Runtime-Adaptive Speculative Decoding Framework with Multi-Policy Orchestration for CPU-Constrained LLM Inference
  7. 2025Nightjar: Dynamic Adaptive Speculative Decoding for Large Language Models Serving
  8. 2025From Quarter to All: Accelerating Speculative LLM Decoding via Floating-Point Exponent Remapping and Parameter Sharing