A Training Framework for Optimal and Stable Training of Polynomial Neural Networks
Not on the map. Why?
Abstract (arXiv)
By replacing standard non-linearities with polynomial activations, Polynomial Neural Networks (PNNs) are pivotal for applications such as privacy-preserving inference via Homomorphic Encryption (HE). However, training PNNs effectively presents a significant challenge: low-degree polynomials can limit model expressivity, while higher-degree polynomials, crucial for capturing complex functions, often suffer from numerical instability and gradient explosion. We introduce a robust and versatile training framework featuring two synergistic innovations: 1) a novel Boundary Loss that exponentially penalizes activation inputs outside a predefined stable range, and 2) Selective Gradient Clipping that effectively tames gradient magnitudes while preserving essential Batch Normalization statistics. We demonstrate our framework's broad efficacy by training PNNs within deep architectures composed of HE-compatible layers (e.g., linear layers, average pooling, batch normalization, as used in ResNet variants) across diverse image, audio, and human activity recognition datasets. These models consistently achieve high accuracy with low-degree polynomial activations (such as degree 2) and, critically, exhibit stable training and strong performance with polynomial degrees up to 22, where standard methods typically fail or suffer severe degradation. Furthermore, the performance of these PNNs achieves a remarkable parity, closely approaching that of their original ReLU-based counterparts. Extensive ablation studies validate the contributions of our techniques and guide hyperparameter selection. We confirm the HE-compatibility of the trained models, advancing the practical deployment of accurate, stable, and secure deep learning inference.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 16 May 2025.
Builds on
22 of 41 references.
References · 22
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 752
- 2019Universal Approximation with Deep Narrow Networkscited by 200
- 2018Gazelle: A Low Latency Framework for Secure Neural Network Inferencecited by 193
- 2019On the Expressive Power of Deep Polynomial Neural Networkscited by 66
- 2018Low Latency Privacy Preserving Inferencecited by 57
- 2017CryptoDL: Deep Neural Networks over Encrypted Datacited by 56
- 2020Pi-nets: Deep Polynomial Neural Networkscited by 39
- 2021Precise Approximation of Convolutional Neural Networks for Homomorphically Encrypted Datacited by 27
- 2022Scalable Interpretability via Polynomialscited by 25
10 more
- 2022Interpretable Polynomial Neural Ordinary Differential Equationscited by 24
- 2019nGraph-HE2: A High-Throughput Framework for Neural Network Inference on Encrypted Datacited by 21
- 2020On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networkscited by 19
- 2023Converting Transformers to Polynomial Form for Secure Inference Over Homomorphic Encryptioncited by 19
- 2024CAPTURE-24: A large dataset of wrist-worn activity tracker data collected in the wild for human activity recognitioncited by 19
- 2022AESPA: Accuracy Preserving Low-degree Polynomial Activation for Fast Private Inferencecited by 14
- 2020Highly Accurate CNN Inference Using Approximate Activation Functions over Homomorphic Encryptioncited by 13
- 2021A methodology for training homomorphicencryption friendly neural networkscited by 10
- 2023Optimized Layerwise Approximation for Efficient Private Inference on Fully Homomorphic Encryptioncited by 4
- 2019Stabilizing Inputs to Approximated Nonlinear Functions for Inference with Homomorphic Encryption in Deep Neural Networkscited by 2
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defectscited by 1
- 2026Homomorphic Advantage Operator: Stabilizing Reinforcement Learning Under Fully Homomorphic Encryption Constraintscited by 0
- 2026HE-OFT: Privacy-Preserving One-Shot Federated Fine-Tuning under Homomorphic Encryptioncited by 0
- 2026HE-OFT: Privacy-Preserving One-Shot Federated Fine-Tuning under Homomorphic Encryption6 Oct 2026
- 2026Homomorphic Advantage Operator: Stabilizing Reinforcement Learning Under Fully Homomorphic Encryption Constraints1 Oct 2026
- 2026Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defects10 May 2026