Loss Function Entropy Regularization for Diverse Decision Boundaries
Not on the map. Why?
Abstract (arXiv)
Is it possible to train several classifiers to perform meaningful crowd-sourcing to produce a better prediction label set without ground-truth annotation? This paper will modify the contrastive learning objectives to automatically train a self-complementing ensemble to produce a state-of-the-art prediction on the CIFAR10 and CIFAR100-20 tasks. This paper will present a straightforward method to modify a single unsupervised classification pipeline to automatically generate an ensemble of neural networks with varied decision boundaries to learn a more extensive feature set of classes. Loss Function Entropy Regularization (LFER) are regularization terms to be added to the pre-training and contrastive learning loss functions. LFER is a gear to modify the entropy state of the output space of unsupervised learning, thereby diversifying the latent representation of decision boundaries of neural networks. Ensemble trained with LFER has higher successful prediction accuracy for samples near decision boundaries. LFER is an adequate gear to perturb decision boundaries and has produced classifiers that beat state-of-the-art at the contrastive learning stage. Experiments show that LFER can produce an ensemble with accuracy comparable to the state-of-the-art yet have varied latent decision boundaries. It allows us to perform meaningful verification for samples near decision boundaries, encouraging the correct classification of near-boundary samples. By compounding the probability of correct prediction of a single sample amongst an ensemble of neural network trained, our method can improve upon a single classifier by denoising and affirming correct feature mappings.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 21 references that are in the map. First posted on arXiv 30 Apr 2022.
Builds on
17 of 21 references.
References · 17
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,472
- 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 806
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2017Regularizing Neural Networks by Penalizing Confident Output Distributionscited by 461
- 2020Debiased Contrastive Learningcited by 354
- 2020SCAN: Learning to Classify Images without Labelscited by 351
- 2018Spreading vectors for similarity searchcited by 114
- 2018Generative Probabilistic Novelty Detection with Adversarial Autoencoderscited by 99
- 2017Unsupervised Learning by Predicting Noisecited by 97
5 more
- 2019Unsupervised Image Matching and Object Discovery as Optimizationcited by 42
- 2017Learning Spread-out Local Feature Descriptorscited by 34
- 2017SUBIC: A supervised, structured binary code for image searchcited by 12
- 2019Unsupervised Pre-Training of Image Features on Non-Curated Datacited by 4
- 2016Approximate search with quantized sparse representationscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.