REVIEW 2 cited by
Tractability of approximation by general shallow networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
In this paper, we present a sharper version of the results in the paper Dimension independent bounds for general shallow networks; Neural Networks, \textbf{123} (2020), 142-152. Let $\mathbb{X}$ and $\mathbb{Y}$ be compact metric spaces. We consider approximation of functions of the form $ x\mapsto\int_{\mathbb{Y}} G( x, y)d\tau( y)$, $ x\in\mathbb{X}$, by $G$-networks of the form $ x\mapsto \sum_{k=1}^n a_kG( x, y_k)$, $ y_1,\cdots, y_n\in\mathbb{Y}$, $a_1,\cdots, a_n\in\mathbb{R}$. Defining the dimensions of $\mathbb{X}$ and $\mathbb{Y}$ in terms of covering numbers, we obtain dimension independent bounds on the degree of approximation in terms of $n$, where also the constants involved are all dependent at most polynomially on the dimensions. Applications include approximation by power rectified linear unit networks, zonal function networks, certain radial basis function networks as well as the important problem of function extension to higher dimensional spaces.
Forward citations
Cited by 2 Pith papers
-
Optimal Neural Network Approximation via Empirical Least Squares with Deterministic Samples
Linearized ReLU^k discrete least squares on the sphere achieves the optimal rate n^{-(r-s)/d} with m roughly n deterministic samples under a parity condition and quasi-uniform points.
-
Integral Representations of Sobolev Spaces via ReLU$^k$ Activation Function and Optimal Error Estimates for Linearized Networks
Sobolev functions of order (d+2k+1)/2 are exactly L2-weighted integrals of ReLU^k ridge functions, and linearized networks with well-distributed fixed weights achieve the optimal n^{-1/2-(2k+1)/(2d)} approximation rate.
Discussion (0). Continue with ORCID to comment.