It is proved that quasi-Chebyshev parameter sets with univariate resolution $m$ generate fixed feature spaces attaining the sharp $H^r$-to-to-H^s$ approximation order for a class of analytic activations satisfying a quantitative non-cancellation condition on their Taylor coefficients.
Abstract
We study Sobolev approximation on bounded domains by linearized shallow neural networks whose inner parameters are prescribed independently of the target function. Our main step is a one-dimensional construction for analytic activations. We prove that quasi-Chebyshev parameter sets with univariate resolution $m$ generate fixed feature spaces attaining the sharp $H^r$-to-$H^s$ approximation order $m^{-(r-s)}$ for a class of analytic activations satisfying a quantitative non-cancellation condition on their Taylor coefficients. Combining this result with the ridge-function lifting theorem in [SIAM J. Math. Anal. 30 (1998), pp. 155-189] and its extension to arbitrary quasi-uniform direction sets established in this work, we construct tensor-product-type parameter sets that attain the sharp rate $$\|f-f_n\|_{L^2(\Omega)}\lesssim n^{-\frac rd}\|f\|_{H^r(\Omega)},\quad f\in H^r(\Omega)$$ for all $r>0$. In contrast to the finite-difference construction in [Neural Comput. 8 (1996), pp. 164-177], whose explicit admissibility condition may require an extremely small parameter scale, the proposed parameter sets remain distributed over fixed intervals and are therefore more amenable to practical computation.
We investigate the best $L_2$ approximation of mixed Sobolev spaces by shallow neural networks with $n$ neurons and general activation functions. We first establish an activation-independent Fourier-block principle: if an activation has univariate approximation order $\rho$ in the sense of the Fourier-block property, t...
It is proved that dictionaries obtained by independent parameter sampling from any prescribed density bounded away from zero attain the same approximation exponent with high probability, up to logarithmic oversampling.
Operator-theoretic generalization bounds for deep multi-output function classes are developed by representing network layers as Koopman composition operators on vector-valued reproducing kernel Hilbert spaces and derive Rademacher complexity bounds for invertible and width-expanding injective architectures.
Mahdi Mohammadigohari, Thomas Borsani, G. Di Fatta· 1 citation
We study the uniform approximation of smooth scalar-valued functionals on an infinite-dimensional separable Hilbert space by deep ReLU neural networks. Writing the functional input as $X(t)=\sum_{d\geq1}\xi_d\nu_d(t)$, we quantify the importance of coordinate $d$ through $w_ds_d$, where $s_d$ bounds the magnitude of th...
This work analyzes how well Sobolev functions in W^{n,p} can be approximated by neural networks with width $W$, depth $L$ and path norm bounded by $K$ when the approximation error is measured in the $W^{1,p}$-norm.
We prove that harmonic functions with Dirichlet boundary data in Barron space, a function class tailored to wide ReLU networks with a single hidden layer and suitably bounded weights, are generally neither Lipschitz continuous nor in the Sobolev class $H^2$. A fortiori, they are not in any function class in which the n...
Stephan Wojtowytsch· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.