Something for (almost) nothing: Improving deep ensemble calibration using unlabeled data
Not on the map. Why?
Abstract (arXiv)
We present a method to improve the calibration of deep ensembles in the small training data regime in the presence of unlabeled data. Our approach is extremely simple to implement: given an unlabeled set, for each unlabeled data point, we simply fit a different randomly selected label with each ensemble member. We provide a theoretical analysis based on a PAC-Bayes bound which guarantees that if we fit such a labeling on unlabeled data, and the true labels on the training data, we obtain low negative log-likelihood and high ensemble diversity on testing samples. Empirically, through detailed experiments, we find that for low to moderately-sized training sets, our ensembles are more diverse and provide better calibration than standard ensembles, sometimes significantly.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 49 references that are in the map. First posted on arXiv 4 Oct 2023.
Builds on
33 of 49 references.
References · 33
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2016Wide Residual Networkscited by 3,057
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2019Measuring Calibration in Deep Learningcited by 443
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
- 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 359
- 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
- 2020Pitfalls of In-Domain Uncertainty Estimation and Ensembling in Deep Learningcited by 208
- 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
21 more
- 2019Are Labels Required for Improving Adversarial Robustness?cited by 162
- 2020Hyperparameter Ensembles for Robustness and Uncertainty Quantificationcited by 149
- 2019Learning Data Augmentation Strategies for Object Detectioncited by 139
- 2019Data augmentation using learned transformations for one-shot medical image segmentationcited by 138
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2021Repulsive Deep Ensembles are Bayesiancited by 103
- 2018Benchmarking Neural Network Robustness to Common Corruptions and Surface Variationscited by 99
- 2017Learning to Compose Domain-Specific Transformations for Data Augmentationcited by 91
- 2022Agree to Disagree: Diversity through Disagreement for Better Transferabilitycited by 69
- 2016A Strongly Quasiconvex PAC-Bayesian Boundcited by 54
- 2021DICE: Diversity in Deep Ensembles via Conditional Redundancy Adversarial Estimationcited by 48
- 2020Second Order PAC-Bayesian Bounds for the Weighted Majority Votecited by 34
- 2021Diversity and Generalization in Neural Network Ensemblescited by 32
- 2021How Tight Can PAC-Bayes be in the Small Data Regime?cited by 24
- 2020Small Data, Big Decisions: Model Selection in the Small-Data Regimecited by 23
- 2021Data augmentation for deep learning based accelerated MRI reconstruction with limited datacited by 19
- 2021Combining Diverse Feature Priorscited by 12
- 2022Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variablescited by 11
- 2021Progress in Self-Certified Neural Networkscited by 10
- 2022Feature Space Particle Inference for Neural Network Ensemblescited by 9
- 2023Multi-Symmetry Ensembles: Improving Diversity and Generalization via Opposing Symmetriescited by 1
Built on by
Not cited yet.