Backend
Convergence of Least Squares Methods for PDEs on R^d with Shallow ReLU^k Networks
arXiv cs.NA0 views
arXiv:2610.14457v2 Announce Type: replace Abstract: We establish inverse inequalities in Gaussian Sobolev norms for shallow $\mathrm{ReLU}^k$ trial spaces. The estimates identify the sharp regularity threshold and quantify the dependence on parameter separation and bias magnitude. Based on these estimates, we prove convergence of weighted least squares discretizations of linear PDEs on $\mathbb R^d$ using shallow networks with prescribed inner parameters and finitely many residual samples in an expanding ball. Under suitable stability and regularity assumptions, we obtain an error bound of order $h^{k+(d+1)/2-r}\delta_\pm^{-(S-r)}$ in the Gaussian Sobolev norm of order $S$, up to logarithmic factors, where $r$ is the PDE order, $h$ is the parameter fill distance, and $\delta_\pm$ is the antipodal separation. The convergence results cover deterministic and random sampling and extend to fixed bounded regions by restriction. We construct parameter sets with $\delta_\pm\asymp h$, yielding a convergence rate in terms of the network width that matches a lower bound up to logarithmic factors. Numerical experiments support the theoretical results and provide practical guidance on balancing accuracy and stability.
Source:https://arxiv.org/abs/2610.14457PreviousThe Normal Procrustes Problem: A Riemannian Optimization ApproachNextSUPN: Shallow Universal Polynomial Networks for Efficient Function Approximation
Related posts
Three dates that catch a hard-coded time-zone bug in a session clock
0dev.to
Laravel N+1 Query Problem: How to Find and Fix It
0dev.to
LongCat-2.5 at $0.30/$1.20: Thinking Locks Temperature, 1M Context, and Vendor Benches Between Opus 4.8 and 5
0dev.to
Shipped: two packages, a registry listing, and the first seals
0dev.to
AI Agent Memory Needs Garbage Collection, Not Just Storage
0dev.to

Securing the Analytics Pipeline and Pivoting for Demo Day
0dev.to