Generating Accurate Pseudo-Labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations
Vishnu Suresh Lokhande, Songwong Tasneeyapant, Abhay Venkatesh, Sathya N. Ravi, Vikas Singh
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers4
- Detection and Continual Learning of Novel Face Presentation AttacksMohammad Rostami, Leonidas Spinoulas, Mohamed E. Hussein, Joe Mathai et al.ICCV 2021 · 51 citations
- Semantic Information in Contrastive LearningShengjiang Quan, Masahiro Hirano, Yuji YamakawaICCV 2023 · 4 citations
- Polynomial, trigonometric, and tropical activationsIsmail Khalfaoui Hassani, Stefan KesselheimICLR 2026 · 1 citation
- Polynomial Composition Activations: Unleashing the Dynamics of Large Language ModelsZhijian Zhuo, Ya Wang, Yutao Zeng, Xiaoqing Li et al.ICLR 2025
Related papers
- ReLUs Are Sufficient for Learning Implicit Neural RepresentationsJoseph Shenouda, Yamin Zhou, Robert D. NowakICML 2024 · 7 citations
- Activation-Free Backbones for Image Recognition: Polynomial Alternatives within MetaFormer-Style Vision ModelsJeffrey Wang, Jonathan Gregory, Grigorios ChrysosICML 2026
- Smooth Maximum Unit: Smooth Activation Function for Deep Networks using Smoothing Maximum TechniqueKoushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar PandeyCVPR 2022 · 61 citations
- Padé Activation Units: End-to-end Learning of Flexible Activation Functions in Deep NetworksAlejandro Molina, Patrick Schramowski, Kristian KerstingICLR 2020 · 116 citations
- Effect of Activation Functions on the Training of Overparametrized Neural NetsAbhishek Panigrahi, Abhishek Shetty, Navin GoyalICLR 2020 · 24 citations
