mlsanityData to 7 Oct 2026

Confident Multiple Choice Learning

arXiv 1706.03475 ↗First posted 12 Jun 2017cs.LG stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

Ensemble methods are arguably the most trustworthy techniques for boosting the performance of machine learning models. Popular independent ensembles (IE) relying on naive averaging/voting scheme have been of typical choice for most applications involving deep neural networks, but they do not consider advanced collaboration among ensemble models. In this paper, we propose new ensemble methods specialized for deep neural networks, called confident multiple choice learning (CMCL): it is a variant of multiple choice learning (MCL) via addressing its overconfidence issue.In particular, the proposed major components of CMCL beyond the original MCL scheme are (i) new loss, i.e., confident oracle loss, (ii) new architecture, i.e., feature sharing and (iii) new training method, i.e., stochastic labeling. We demonstrate the effect of CMCL via experiments on the image classification on CIFAR and SVHN, and the foreground-background segmentation on the iCoseg. In particular, CMCL using 5 residual networks provides 14.05% and 6.60% relative reductions in the top-1 error rates from the corresponding IE scheme for the classification task on CIFAR and SVHN, respectively.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 3; 2023: 4; 2024: 6; 2025: 3; 2026: 1.

24 papers.

Sort:

By area:

  1. 2021SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustnesscited by 49
  2. 2022Residual Mixture of Expertscited by 39
  3. 2021Probabilistic Modeling of Semantic Ambiguity for Scene Graph Generationcited by 35
  4. 2021Embracing Uncertainty: Decoupling and De-bias for Robust Temporal Groundingcited by 29
  5. 2021DP-SSL: Towards Robust Semi-supervised Learning with A Few Labeled Samplescited by 18
  6. 2023Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysiscited by 12
  7. 2024Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealingcited by 12
  8. 2021MCL-GAN: Generative Adversarial Networks with Multiple Specialized Discriminatorscited by 11
  9. 2021kFolden: k-Fold Ensemble for Out-Of-Distribution Detectioncited by 10
  10. 2022EUCLID: Towards Efficient Unsupervised Reinforcement Learning with Multi-choice Dynamics Modelcited by 8
  11. 2023ManiPose: Manifold-Constrained Multi-Hypothesis 3D Human Pose Estimationcited by 6
  12. 2024Winner-takes-all learners are geometry-aware conditional density estimatorscited by 6
12 more
  1. 2022Self-Activating Neural Ensembles for Continual Reinforcement Learningcited by 5
  2. 2024Hierarchical Uncertainty Exploration via Feedforward Posterior Treescited by 4
  3. 2024CryoSPIN: Improving Ab-Initio Cryo-EM Reconstruction with Semi-Amortized Pose Inferencecited by 4
  4. 2024Annealed Winner-Takes-All for Motion Forecastingcited by 4
  5. 2025Winner-takes-all for Multivariate Probabilistic Time Series Forecastingcited by 4
  6. 2025Multiple Choice Learning of Low-Rank Adapters for Language Modelingcited by 2
  7. 2023Multiple Hypothesis Dropout: Estimating the Parameters of Multi-Modal Output Distributionscited by 1
  8. 2021Auxiliary Class Based Multiple Choice Learningcited by 0
  9. 2023Masked Vector Quantizationcited by 0
  10. 2024Towards Diverse Perspective Learning with Selection over Multiple Temporal Poolingscited by 0
  11. 2025Conditional Distribution Quantization in Machine Learningcited by 0
  12. 2026CHASE: Competing Hypotheses for Ambiguity-Aware Selective Predictioncited by 0