mlsanityData to 14 Oct 2026

DART: Input-Difficulty-AwaRe Adaptive Threshold for Early-Exit DNNs

arXiv 2603.12269 ↗First posted 17 Feb 2026cs.AR cs.AI cs.LGcited by 0

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

Abstract (arXiv)

Early-exit deep neural networks enable adaptive inference by terminating computation when sufficient confidence is achieved, reducing cost for edge AI accelerators in resource-constrained settings. Existing methods, however, rely on suboptimal exit policies, ignore input difficulty, and optimize thresholds independently. This paper introduces DART (Input-Difficulty-Aware Adaptive Threshold), a framework that overcomes these limitations. DART introduces three key innovations: (1) a lightweight difficulty estimation module that quantifies input complexity with minimal computational overhead, (2) a joint exit policy optimization algorithm based on dynamic programming, and (3) an adaptive coefficient management system. Experiments on diverse DNN benchmarks (AlexNet, ResNet-18, VGG-16) demonstrate that DART achieves up to 3.3× speedup, 5.1× lower energy, and up to 42% lower average power compared to static networks, while preserving competitive accuracy. Extending DART to Vision Transformers (LeViT) yields power (5.0×) and execution-time (3.6×) gains but also accuracy loss (up to 17 percent), underscoring the need for transformer-specific early-exit mechanisms. We further introduce the Difficulty-Aware Efficiency Score (DAES), a novel multi-objective metric, under which DART achieves up to a 14.8 improvement over baselines, highlighting superior accuracy, efficiency, and robustness trade-offs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 7 of its 18 references that are in the map. First posted on arXiv 17 Feb 2026.

Builds on

7 of 18 references.

Closest ancestors · 1

Same direction, newest first

  1. 2023Early-Exit with Class Exclusion for Efficient Inference of Neural Networks23 Sep

Other references · 6

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  2. 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
  3. 2021Dynamic Neural Networks: A Surveycited by 408
  4. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
  5. 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
  6. 2020Neural Complexity Measurescited by 11

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2021Adaptive Inference through Early-Exit Networks: Design, Challenges and Directions
  2. 2023Adaptive Deep Neural Network Inference Optimization with EENet
  3. 2025Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability
  4. 2025A Survey of Early Exit Deep Neural Networks in NLP
  5. 2025AEBNAS: Strengthening Exit Branches in Early-Exit Networks through Hardware-Aware Neural Architecture Search
  6. 2023On the fly Deep Neural Network Optimization Control for Low-Power Computer Vision
  7. 2026DART-ES: Difficulty-Aware Reweighting and Targeted Replay for Fine-Tuning LLMs with Evolution Strategies
  8. 2025DART: Difficulty-Adaptive Reasoning Truncation for Efficient Large Language Models