Abstract
Multiple Choice Learning (MCL) algorithms involve an 'oracle' user with unmodeled biases that selects a preferred output among several possible hypotheses. We identify a shortcoming and training obstacle of the recent Stochastic Multiple Choice Learning (sMCL) algorithm. When an ensemble of neural networks trains under sMCL, the best performing model receives the majority of parameter updates at the expense of other ensemble members. We refer to this sMCL training issue as Alpha Model Domination (AMD) and empirically demonstrate that AMD does not resolve itself with longer training time. We introduce several novel MCL loss functions that both avoid AMD and yield statistically significant improvements in oracle accuracy (OA) compared to sMCL. Using the MNIST, CIFAR-10, and ImageNet classification datasets, we empirically demonstrate the superior performance of our proposed loss functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
