Papers › Window-Based Early-Exit Cascades for Uncertainty Estimation: When Deep Ensembles are...
Window-Based Early-Exit Cascades for Uncertainty Estimation: When Deep Ensembles are More Efficient than Single Models
Guoxuan Xia, Christos-Savvas Bouganis
Deep Ensembles are a simple, reliable, and effective method of improving both the predictive performance and uncertainty estimates of deep learning approaches. However, they are widely criticised as being computationally expensive, due to the need to deploy multiple independent models. Recent work has challenged this view, showing that for predictive accuracy, ensembles can be more computationally efficient (at inference) than scaling single models within an architecture family. This is achieved by cascading ensemble members via an early-exit approach. In this work, we investigate extending these efficiency gains to tasks related to uncertainty estimation. As many such tasks, e.g. selective classification, are binary classification, our key novel insight is to only pass samples within a window close to the binary decision boundary to later cascade stages. Experiments on ImageNet-scale data across a number of network architectures and uncertainty tasks show that the proposed window-based early-exit approach is able to achieve a superior uncertainty-computation trade-off compared to scaling single models. For example, a cascaded EfficientNet-B2 ensemble is able to achieve similar coverage at 5% risk as a single EfficientNet-B4 with <30% the number of MACs. We also find that cascades/ensembles give more reliable improvements on OOD data vs scaling models up. Code for this work is available at: https://github.com/Guoxoug/window-early-exit.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2303.08010")
Code
Syntology Ran 1 of 36 code samples harvested from 2 repositories linked to this paper; 35 have no recorded run. Of those that ran: 1 ran · fixture could not drive it.
By repository: official repository: 1 sample from 1 repository, 1 ran; found in paper text by Syntology: 35 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
36 samples harvested; 1 ran; 0 honoured the contract we drafted; 35 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 0 of the 36 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
333af359ab2bc74e · report
9faec97eab071c9e · report
b7f04958b9956ab3 · report
92506576e1211977 · report
8566faf0283e84b5 · report
bfe7ed6cde8213a2 · report
3562a18df7063eac · report
6bd8585a9f22e0d2 · report
621b43910a11301f · report
3c500f029705ef98 · report
2a31220d9622da08 · report
418f46abf7d3fddd · report
775b31b0717143c0 · report
8c030c1dd2cba50c · report
c84bba05a0e9fe98 · report
8c4c044b0da3d59d · report
b55586ffc10b9cf8 · report
0dd0e7197a272037 · report
d5da2aff6d992a41 · report
b8a4e52b0b228ca8 · report
fcfce33cd8b78e31 · report
80a7dd835e5af022 · report
ff36a3530575a45b · report
b1f9e5129fa630a1 · report
072dde7fd28b54c1 · report
a86f237c3dfe72fb · report
47c0511b0bcb81fb · report
fe1fee1f08d6f46d · report
86361b3f206f4002 · report
b3bae248d68eaa66 · report
dc94020311204486 · report
59c7dca60305d651 · report
2d9c9582df92bc5e · report
24a8d4e26aa2e281 · report
6cc796a8212b5586 · report
ce877225caec4bfe · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections