Shallow neural network approximation in mixed Sobolev spaces
Abstract
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 $ρ$ in the sense of the Fourier-block property, then the global approximation rate has algebraic order $\min\{α,ρ\}$ for target functions of mixed smoothness $α$, up to explicit logarithmic factors. To verify this property for concr...
Description / Details
We investigate the best approximation of mixed Sobolev spaces by shallow neural networks with neurons and general activation functions. We first establish an activation-independent Fourier-block principle: if an activation has univariate approximation order in the sense of the Fourier-block property, then the global approximation rate has algebraic order for target functions of mixed smoothness , up to explicit logarithmic factors. To verify this property for concrete activations, we introduce a structured univariate approximation condition that implies the Fourier-block property with explicit parameters. For , a matching algebraic lower bound identifies as the optimal algebraic approximation exponent in any dimension, up to logarithmic factors in the upper bound. The framework also yields the exponent for cardinal B-splines and soft-, and the full mixed-smoothness exponent for ELU and cosine activations, again up to logarithmic~factors.
Source: arXiv:2609.05263v1 - http://arxiv.org/abs/2609.05263v1 PDF: https://arxiv.org/pdf/2609.05263v1 Original Link: http://arxiv.org/abs/2609.05263v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Sep 7, 2026
Mathematics
Mathematics
0