Sharp Lower Bounds for Linearized ReLU^k Approximation on Sphere

A saturation theorem shows ReLU^k networks on the sphere cannot beat an L2 error rate of n^{-(d+2k+1)/(2d)} when smoothness r > (d+2k+1)/2. 5 Oct 2025. Read more: getnews.me/sharp-lower-bounds-for-l... #relu #saturationtheorem #approximation