Neural Approximation by Function Composition: Rigidity and Doubly Exponential Convergence

arXiv:2609.25874 · cs.LG, cs.IT, math.IT · Submitted 2026-09-22 · Read on arXiv

cs.LG, cs.IT, math.IT

Submitted: 2026-09-22

Updated: 2026-09-22

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Accuracy — 8× in this paper · explained in 1 episode
• Neural Network Approximation — 4× in this paper · explained in 2 episodes
• Approximation Bound — 3× in this paper · explained in 1 episode
• Chebyshev Polynomials — 2× in this paper · explained in 2 episodes
• Curse of Dimensionality — 1× in this paper · explained in 6 episodes

Sources

• Mathematical theory of deep learning

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: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks