Pith. sign in

REVIEW 2 cited by

Pitfalls of In-Domain Uncertainty Estimation and Ensembling in Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.06470 v4 pith:DTRFPYH4 submitted 2020-02-15 stat.ML cs.LG

classification stat.MLcs.LG
keywords ensemblinguncertaintyestimationdeeppitfallsensembleequivalentin-domain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Uncertainty estimation and ensembling methods go hand-in-hand. Uncertainty estimation is one of the main benchmarks for assessment of ensembling performance. At the same time, deep learning ensembles have provided state-of-the-art results in uncertainty estimation. In this work, we focus on in-domain uncertainty for image classification. We explore the standards for its quantification and point out pitfalls of existing metrics. Avoiding these pitfalls, we perform a broad study of different ensembling techniques. To provide more insight in this study, we introduce the deep ensemble equivalent score (DEE) and show that many sophisticated ensembling techniques are equivalent to an ensemble of only few independently trained networks in terms of test performance.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ADVMEM: Adversarial Memory Initialization for Realistic Test-Time Adaptation via Tracklet-Based Benchmarking

    cs.CV 2025-09 conditional novelty 6.0 of 10

    A tracklet-based TTA benchmark (ITD) plus ADVMEM, an adversarial memory initialization that substantially improves memory-based methods like SHOT-IM and TENT under temporal dependence.

  2. Learning, fast and slow: a two-fold algorithm for data-based model adaptation

    eess.SY 2025-07 conditional novelty 6.0 of 10

    Combining control-chart-triggered ensemble expansion with online Gaussian process residual correction lifts FIT from 69.5% to 94.2% on a district heating case.

Pith tools