SUPN: Shallow Universal Polynomial Networks for Efficient Function Approximation

arXiv:2511.21414 · cs.LG, cs.NA, math.NA · Submitted 2025-11-26 · Read on arXiv

cs.LG, cs.NA, math.NA

Submitted: 2025-11-26

Updated: 2026-10-15

Terminology

• Accuracy — 1× in this paper · explained in 1 episode
• Generalization — 1× in this paper · explained in 13 episodes
• Kolmogorov-Arnold Networks (KANs) — 1× in this paper · explained in 3 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks