Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations

• Published in: Proceedings (IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Online) Vol. 2020; pp. 11432 - 11440
• Main Authors: Lokhande, Vishnu Suresh, Tasneeyapant, Songwong, Venkatesh, Abhay, Ravi, Sathya N., Singh, Vikas
• Format: Conference Proceeding Journal Article
• Language: English
• Published: United States IEEE 01.06.2020
• Subjects: Computer vision; Convergence; Neural networks; Optimization; Semisupervised learning; Supervised learning; Training
• ISSN: 1063-6919; 1063-6919; 2575-7075
• DOI: 10.1109/CVPR42600.2020.01145

Rectified Linear Units (ReLUs) are among the most widely used activation function in a broad variety of tasks in vision. Recent theoretical results suggest that despite their excellent practical performance, in various cases, a substitution with basis expansions (e.g., polynomials) can yield significant benefits from both the optimization and generalization perspective. Unfortunately, the existing results remain limited to networks with a couple of layers, and the practical viability of these results is not yet known. Motivated by some of these results, we explore the use of Hermite polynomial expansions as a substitute for ReLUs in deep networks. While our experiments with supervised learning do not provide a clear verdict, we find that this strategy offers considerable benefits in semi-supervised learning (SSL) / transductive learning settings. We carefully develop this idea and show how the use of Hermite polynomials based activations can yield improvements in pseudo-label accuracies and sizable financial savings (due to concurrent runtime benefits). Further, we show via theoretical analysis, that the networks (with Hermite activations) offer robustness to noise and other attractive mathematical properties.