Understanding the Robustness of Multi-Exit Models under Common Corruptions
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Multi-Exit models (MEMs) use an early-exit strategy to improve the accuracy and efficiency of deep neural networks (DNNs) by allowing samples to exit the network before the last layer. However, the effectiveness of MEMs in the presence of distribution shifts remains largely unexplored. Our work examines how distribution shifts generated by common image corruptions affect the accuracy/efficiency of MEMs. We find that under common corruptions, early-exiting at the first correct exit reduces the inference cost and provides a significant boost in accuracy ( 10%) over exiting at the last layer. However, with realistic early-exit strategies, which do not assume knowledge about the correct exits, MEMs still reduce inference cost but provide a marginal improvement in accuracy (1%) compared to exiting at the last layer. Moreover, the presence of distribution shift widens the gap between an MEM's maximum classification accuracy and realistic early-exit strategies by 5% on average compared with the gap on in-distribution data. Our empirical analysis shows that the lack of calibration due to a distribution shift increases the susceptibility of such early-exit strategies to exit early and increases misclassification rates. Furthermore, the lack of calibration increases the inconsistency in the predictions of the model across exits, leading to both inefficient inference and more misclassifications compared with evaluation on in-distribution data. Finally, we propose two metrics, underthinking and overthinking, that quantify the different behavior of practical early-exit strategy under distribution shifts, and provide insights into improving the practical utility of MEMs.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 44 of its 51 references that are in the map. First posted on arXiv 3 Dec 2022.
Builds on
44 of 51 references.
Closest ancestors · 3
Same direction, newest first
- 2022HuBERT-EE: Early Exiting HuBERT for Efficient Speech Recognition13 Apr
- 2021Zero Time Waste: Recycling Predictions in Early Exit Neural Networks9 Jun
- 2021Adaptive Inference through Early-Exit Networks: Design, Challenges and Directions9 Jun
Other references · 41
- 2022Generative Adversarial Networkscited by 5,627
- 2013Intriguing properties of neural networkscited by 5,155
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,319
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,287
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
- 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 901
29 more
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
- 2018Object Detection with Deep Learning: A Reviewcited by 528
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 431
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
- 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 332
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
- 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 226
- 2018Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learningcited by 207
- 2017Convolutional Networks with Adaptive Inference Graphscited by 148
- 2017Interpreting Deep Visual Representations via Network Dissectioncited by 103
- 2018Benchmarking Neural Network Robustness to Common Corruptions and Surface Variationscited by 99
- 2021MOOD: Multi-level Out-of-distribution Detectioncited by 94
- 2022Head2Toe: Utilizing Intermediate Representations for Better Transfer Learningcited by 83
- 2020Why should we add early exits to neural networks?cited by 70
- 2021A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustnesscited by 62
- 2020A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inferencecited by 61
- 2020Revisiting Batch Normalization for Improving Corruption Robustnesscited by 55
- 2019How Can We Be So Dense? The Benefits of Using Highly Sparse Representationscited by 45
- 2020Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inferencecited by 45
- 2013Low-Rank Approximations for Conditional Feedforward Computation in Deep Neural Networkscited by 44
- 2021Neural Mean Discrepancy for Efficient Out-of-Distribution Detectioncited by 42
- 2017Deciding How to Decide: Dynamic Routing in Artificial Neural Networkscited by 33
- 2021Early Exiting with Ensemble Internal Classifierscited by 19
- 2021Anytime Dense Prediction with Confidence Adaptivitycited by 18
- 2021Certified Adversarial Defenses Meet Out-of-Distribution Corruptions: Benchmarking Robustness and Simple Baselinescited by 17
- 2020How Robust are Randomized Smoothing based Defenses to Data Poisoning?cited by 15
- 2021Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoningcited by 11
- 2021Improving Anytime Prediction with Parallel Cascaded Networks and a Temporal-Difference Losscited by 6
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 2.
4 papers.
- 2023Overthinking the Truth: Understanding how Language Models Process False Demonstrationscited by 81
- 2023Adaptivity and Modularity for Efficient Generalization Over Task Complexitycited by 7
- 2025Efficiency Robustness of Dynamic Deep Learning Systemscited by 1
- 2025Nav-EE: Navigation-Guided Early Exiting for Efficient Vision-Language Models in Autonomous Drivingcited by 0
- 2025Nav-EE: Navigation-Guided Early Exiting for Efficient Vision-Language Models in Autonomous Driving2 Oct 2025
- 2025Efficiency Robustness of Dynamic Deep Learning Systems12 Jun 2025
- 2023Adaptivity and Modularity for Efficient Generalization Over Task Complexity13 Oct 2023
- 2023Overthinking the Truth: Understanding how Language Models Process False Demonstrations18 Jul 2023
Similar, not cited
Close in wording, no citation either way
- 2025BEEM: Boosting Performance of Early Exit DNNs using Multi-Exit Classifiers as Experts
- 2025Rethinking Calibration for Early-Exit Neural Networks
- 2021Consistency Training of Multi-exit Architectures for Sensor Data
- 2024Slight Corruption in Pre-training Data Makes Better Diffusion Models
- 2024Exploring Diffusion Models' Corruption Stage in Few-Shot Fine-tuning and Mitigating with Bayesian Neural Networks
- 2025Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability
- 2026SAFE-KD: Risk-Controlled Early-Exit Distillation for Vision Backbones
- 2026Depth Laws for the Precision Floor of Trained Neural Networks: Amplification, Residual Scaling, and a Quantization-Aware Training Paradox