Skip to content

Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples

Xinliang Liu, Tong Mao, Jinchao Xu

math.NAarXiv:2608.06687

Abstract

We develop a rigorous theory of discrete residual least-squares approximation for elliptic spectral equations Lβu=f using linearized ReLUk neural networks on the sphere, where Lβ is a positive elliptic spectral multiplier of order β. Given a parameter set Θn=\θj*\j=1n⊂ Sd, we approximate u in the linearized network space Lnk(Θn) by the discrete residual on the collocation points \ηi*\i=1m equation* un,m∈vn∈ Lnk(Θn)1mΣi=1m(f(ηi*)- Lβvn(ηi*))2. equation* With k>d-12+β, for antipodally quasi-uniform network parameter sets and any quasi-uniform collocation points with m n, we prove that equation* \|u-un,m\| Hβ( Sd)\|f- Lβun,m\| L2( Sd) n-rd cases \|f\| Wr,p( Sd),&dp<r≤ d2,~p>2,\\ \|f\| Hr( Sd),&r>d2. cases 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 network spaces. If h denotes the antipodal separation distance of the network parameters, then equation* \|vn\| Hr( Sd) h-(r-s)\|vn\| Hs( Sd), 0≤ s<r<k+12. equation*

Create a lesson