On the Rate of Convergence of GD in Non-linear Neural Networks: An Adversarial Robustness Perspective

arXiv:2603.02095 · cs.LG, cs.AI · Submitted 2026-03-02 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-03-02

Updated: 2026-10-08

Terminology

• Robustness — 3× in this paper · explained in 5 episodes
• Adversarial Robustness — 1× in this paper · explained in 3 episodes
• Gradient Descent — 1× in this paper
• Theoretical Guarantees — 1× in this paper · explained in 2 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