math.NAAug 7, 2026

Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples

Authors: Xinliang LiuTong MaoJinchao Xu

Organizations: School of Mathematical Sciences, Ocean University of China, Qingdao 266100, China · Shenzhen Loop Area Institute, Shenzhen 518000, P. R. China

Abstract

We develop a rigorous theory of discrete residual least-squares approximation for elliptic spectral equations Lβu=f\mathfrak L_βu=f using linearized ReLUk^k neural networks on the sphere, where Lβ\mathfrak L_β is a positive elliptic spectral multiplier of order ββ. Given a parameter set Θn={θj}j=1nSdΘ_n=\{θ_{j}^*\}_{j=1}^n\subset\mathbb S^d, we approximate uu in the linearized network space Lnk(Θn)L_n^k(Θ_n) by the discrete residual on the collocation points {ηi}i=1m\{η_i^*\}_{i=1}^m \begin{equation*} u_{n,m}\in\arg\min_{v_n\in L_n^k(Θ_n)}\frac1m\sum_{i=1}^m\left(f(η_i^)-\mathfrak L_βv_n(η_i^)\right)^2. \end{equation*} With k>d12+βk>\frac{d-1}{2}+β, for antipodally quasi-uniform network parameter sets and any quasi-uniform collocation points with mnm\gtrsim n, we prove that \begin{equation*} |u-u_{n,m}|{\mathcal H^β(\mathbb S^d)}\eqsim|f-\mathfrak L_βu{n,m}|{\mathcal L^2(\mathbb S^d)}\lesssim n^{-\frac{r}{d}} \begin{cases} |f|{\mathcal W^{r,p}(\mathbb S^d)},&\frac{d}{p}<r\leq \frac{d}{2},~p>2,\ |f|{\mathcal H^r(\mathbb S^d)},&r>\frac{d}{2}. \end{cases} \end{equation*} We also establish a high-probability residual estimate, up to a logarithmic factor and an arbitrarily small smoothness loss, for i.i.d.\ uniformly distributed collocation points. The key analytical ingredient is a Bernstein inequality for linearized ReLUk^k network spaces. If h\underline h denotes the antipodal separation distance of the network parameters, then \begin{equation*} |v_n|{\mathcal H^r(\mathbb S^d)}\lesssim\underline h^{-(r-s)}|v_n|_{\mathcal H^s(\mathbb S^d)},\qquad 0\leq s<r<k+\tfrac12. \end{equation*}

Explore similar work

Oct 5, 2025math.NA

Configuration-Dependent Lower Bounds for Approximation by Shallow ReLU^k Networks on the Sphere

We establish two related but logically distinct results for shallow ReLUk^k neural networks on the unit sphere \SSd\SS^d. First, for an arbitrary set of inner neural-network parameters, the best L2(\SSd)\mathcal{L}^2(\SS^d) approximation of a fixed target function with smoothness r>d+2k+12r>\tfrac{d+2k+1}{2} admits an asymptotic lower bound given by a constant multiple of n1/2hk+1/2n^{-1/2}\underline{h}^{k+1/2}, where h\underline{h} denotes the antipodal separation distance of the normalized inner-parameter set. This lower bound depends explicitly on the parameter configuration through h\underline{h} and applies without additional assumptions on the parameters. Second, for antipodally quasi-uniform parameters, hn1/d\underline{h}\simeq n^{-1/d}, and the lower bound establishes the exact saturation order nd+2k+12dn^{-\frac{d+2k+1}{2d}} for such parameter families: a target function with regularity greater than d+2k+12\frac{d+2k+1}{2} and satisfying the required parity condition can be approximated at this rate, whereas approximation at any strictly faster rate forces the target function to be zero. Our results therefore place linearized neural-network approximation within the classical saturation framework and show that, although ReLUk^k network spaces can outperform finite elements of the same degree, this advantage is intrinsically limited.
Tong Mao, Jinchao Xu
Jul 15, 2026math.NA

Approximation of solutions of parameter-dependent problems by residual neural networks

We develop a convergent scheme to train neural networks involving analytic activation functions based on gradient flows. Convergence properties are guaranteed by Lojasiewicz theory. The main advantage of this approach is its simplicity of implementation. The coefficients of the network are approximated by solving a system of ordinary differential equations. We test the method by constructing residual neural network approximations of solutions of parametric problems. The dependence of the solutions of simple ordinary differential equations on a few parameters is correctly reproduced. The solutions of inverse problems involving wave constraints which depend on a few parameters can be reasonably approximated, even in regions in which the problem is severely ill posed.
Ana Carpio
Sep 14, 2026stat.ML

Approximating Smooth Functionals with ReLU Networks

We study the uniform approximation of smooth scalar-valued functionals on an infinite-dimensional separable Hilbert space by ReLU neural networks. A key feature in deep learning for functional data is the varying importance of different coordinates/dimensions. Representing the functional input in a basis expansion, we quantify the importance of each coordinate through both the magnitude of its corresponding basis score and the directional sensitivity of the target functional. Our analysis combines coordinate truncation, anisotropic partitioning, local Taylor approximation, and ReLU network realization, while allowing unrestricted interactions among the retained coordinates. We establish a general nonasymptotic upper bound for the uniform approximation error and a complementary pseudo-dimension-based lower bound for the worst-case approximation error. Under generalized exponential coordinate decay wdsdexp(cdρ)w_ds_d\asymp\exp(-cd^ρ), with ρ>0ρ>0, the upper and lower bounds match at the leading order, which is stretched-exponential in the logarithm of the network size budget, and thus yield the nearly optimal approximation rate. This is the first work to characterize neural network approximation error for infinite-dimensional functional inputs explicitly through the joint dimensional decay of coordinate magnitudes and directional sensitivities.
Shuhao Jiao