A mixture model for aggregation of multiple pre-trained weak classifiers
Rudrasis Chakraborty, Chun-Hao Yang, Baba C. Vemuri

TL;DR
This paper introduces a fast, re-training-free mixture model approach to aggregate multiple pre-trained weak classifiers, significantly boosting classification accuracy without extensive computational resources.
Contribution
The proposed mixture model aggregates outputs of pre-trained classifiers without re-training, enabling efficient performance boost and feature combination from diverse sources.
Findings
Boosts classification performance by 12% without re-training.
Achieves aggregation in less than 30 seconds computationally.
Effectively combines features from different networks or algorithms.
Abstract
Deep networks have gained immense popularity in Computer Vision and other fields in the past few years due to their remarkable performance on recognition/classification tasks surpassing the state-of-the art. One of the keys to their success lies in the richness of the automatically learned features. In order to get very good accuracy, one popular option is to increase the depth of the network. Training such a deep network is however infeasible or impractical with moderate computational resources and budget. The other alternative to increase the performance is to learn multiple weak classifiers and boost their performance using a boosting algorithm or a variant thereof. But, one of the problems with boosting algorithms is that they require a re-training of the networks based on the misclassified samples. Motivated by these problems, in this work we propose an aggregation technique which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
