mlsanityData to 14 Oct 2026

Functional Ensemble Distillation

arXiv 2206.02183 ↗First posted 5 Jun 2022cs.LG cs.CV stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Bayesian models have many desirable properties, most notable is their ability to generalize from limited data and to properly estimate the uncertainty in their predictions. However, these benefits come at a steep computational cost as Bayesian inference, in most cases, is computationally intractable. One popular approach to alleviate this problem is using a Monte-Carlo estimation with an ensemble of models sampled from the posterior. However, this approach still comes at a significant computational cost, as one needs to store and run multiple models at test time. In this work, we investigate how to best distill an ensemble's predictions using an efficient model. First, we argue that current approaches that simply return distribution over predictions cannot compute important properties, such as the covariance between predictions, which can be valuable for further processing. Second, in many limited data settings, all ensemble members achieve nearly zero training loss, namely, they produce near-identical predictions on the training set which results in sub-optimal distilled models. To address both problems, we propose a novel and general distillation approach, named Functional Ensemble Distillation (FED), and we investigate how to best distill an ensemble in this setting. We find that learning the distilled model via a simple augmentation scheme in the form of mixup augmentation significantly boosts the performance. We evaluated our method on several tasks and showed that it achieves superior results in both accuracy and uncertainty estimation compared to current approaches.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 48 references that are in the map. First posted on arXiv 5 Jun 2022.

Builds on

26 of 48 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  5. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  6. 2017On Calibration of Modern Neural Networkscited by 4,960
  7. 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
  8. 2018Group Normalizationcited by 1,524
  9. 2018Predictive Uncertainty Estimation via Prior Networkscited by 557
  10. 2015Variational Dropout and the Local Reparameterization Trickcited by 490
  11. 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 371
  12. 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 365
14 more
  1. 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 308
  2. 2015Generative Moment Matching Networkscited by 257
  3. 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 254
  4. 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
  5. 2018Bayesian Model-Agnostic Meta-Learningcited by 194
  6. 2019Ensemble Distribution Distillationcited by 158
  7. 2021Personalized Federated Learning with Gaussian Processescited by 76
  8. 2015Bayesian Dark Knowledgecited by 45
  9. 2020Bayesian Few-Shot Classification with One-vs-Each P'olya-Gamma Augmented Gaussian Processescited by 32
  10. 2020Hydra: Preserving Ensemble Diversity for Model Distillationcited by 31
  11. 2021Diversity Matters When Learning From Ensemblescited by 27
  12. 2021GP-Tree: A Gaussian Process Classifier for Few-Shot Incremental Learningcited by 26
  13. 2020Restoration of Fragmentary Babylonian Texts Using Recurrent Neural Networkscited by 11
  14. 2015Distilling Model Knowledgecited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.

3 papers.