Performance Control in Early Exiting to Deploy Large Models at the Same Cost of Smaller Ones
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Early Exiting (EE) is a promising technique for speeding up inference by adaptively allocating compute resources to data points based on their difficulty. The approach enables predictions to exit at earlier layers for simpler samples while reserving more computation for challenging ones. In this study, we first present a novel perspective on the EE approach, showing that larger models deployed with EE can achieve higher performance than smaller models while maintaining similar computational costs. As existing EE approaches rely on confidence estimation at each exit point, we further study the impact of overconfidence on the controllability of the compute-performance trade-off. We introduce Performance Control Early Exiting (PCEE), a method that enables accuracy thresholding by basing decisions not on a data point's confidence but on the average accuracy of samples with similar confidence levels from a held-out validation set. In our experiments, we show that PCEE offers a simple yet computationally efficient approach that provides better control over performance than standard confidence-based approaches, and allows us to scale up model sizes to yield performance gain while reducing the computational cost.
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 33 of its 46 references that are in the map. First posted on arXiv 26 Dec 2024.
Builds on
33 of 46 references.
Closest ancestors · 3
Same direction, newest first
- 2023Towards Anytime Classification in Early-Exit Architectures by Enforcing Conditional Monotonicity5 Jun
- 2022Confident Adaptive Language Modeling14 Jul
- 2021Adaptive Inference through Early-Exit Networks: Design, Challenges and Directions9 Jun
Other references · 30
- 2017Attention Is All You Needcited by 59,932
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
- 2023Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizescited by 710
18 more
- 2018Universal Transformerscited by 613
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 591
- 2021Open-Set Recognition: a Good Closed-Set Classifier is All You Need?cited by 351
- 2018Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problemcited by 323
- 2024xLSTM: Extended Long Short-Term Memorycited by 320
- 2015LSTM: A Search Space Odysseycited by 315
- 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 289
- 2019Depth-Adaptive Transformercited by 227
- 2018To Trust Or Not To Trust A Classifiercited by 205
- 2018Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learningcited by 203
- 2021Consistent Accelerated Inference via Confident Adaptive Transformerscited by 73
- 2023Calibration in Deep Learning: A Survey of the State-of-the-Artcited by 72
- 2019Deep Gamblers: Learning to Abstain with Portfolio Theorycited by 69
- 2022A Stitch in Time Saves Nine: A Train-Time Regularizing Loss for Improved Neural Network Calibrationcited by 49
- 2022Towards Better Selective Classificationcited by 21
- 2023Fixing Overconfidence in Dynamic Neural Networkscited by 19
- 2022The Calibration Generalization Gapcited by 18
- 2017On-the-fly Operation Batching in Dynamic Computation Graphscited by 7
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
- 2026Proteus: Incremental Memory Activation for Long-Context Sequence Modelingcited by 1
- 2025SimLens for Early Exit in Large Language Models: Eliciting Accurate Latent Predictions with One More Tokencited by 0
- 2025Rethinking Calibration for Early-Exit Neural Networkscited by 0
- 2026Proteus: Incremental Memory Activation for Long-Context Sequence Modeling17 Aug 2026
- 2025Rethinking Calibration for Early-Exit Neural Networks29 Aug 2025
- 2025SimLens for Early Exit in Large Language Models: Eliciting Accurate Latent Predictions with One More Token23 Jul 2025
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computation14 Jul 2025
Similar, not cited
Close in wording, no citation either way
- 2024Fast yet Safe: Early-Exiting with Risk Control
- 2023Finding the SWEET Spot: Analysis and Improvement of Adaptive Inference in Low Resource Settings
- 2026When Does Learning to Stop Help? A Cost-Aware Study of Early Exits in Reasoning Models
- 2025Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability
- 2025Improving Prediction Certainty Estimation for Reliable Early Exiting via Null Space Projection
- 2025HELIOS: Adaptive Model And Early-Exit Selection for Efficient LLM Inference Serving
- 2024RAEE: A Robust Retrieval-Augmented Early Exit Framework for Efficient Inference
- 2025Know What You Don't Know: Selective Prediction for Early Exit DNNs