REVIEW 2 cited by
Approximation of RKHS Functionals by Neural 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
read the original abstract
Motivated by the abundance of functional data such as time series and images, there has been a growing interest in integrating such data into neural networks and learning maps from function spaces to R (i.e., functionals). In this paper, we study the approximation of functionals on reproducing kernel Hilbert spaces (RKHS's) using neural networks. We establish the universality of the approximation of functionals on the RKHS's. Specifically, we derive explicit error bounds for those induced by inverse multiquadric, Gaussian, and Sobolev kernels. Moreover, we apply our findings to functional regression, proving that neural networks can accurately approximate the regression maps in generalized functional linear models. Existing works on functional learning require integration-type basis function expansions with a set of pre-specified basis functions. By leveraging the interpolating orthogonal projections in RKHS's, our proposed network is much simpler in that we use point evaluations to replace basis function expansions.
Forward citations
Cited by 2 Pith papers
-
Boundary-Adapted PINNs for Elliptic Dirichlet Problems: $H^2(\Omega)$ A Priori Error Bounds with Application to Mean Escape Time Computation
Boundary-adapted PINNs with first-order normalized distance functions admit H²(Ω) a priori error bounds with explicit rates, while unnormalized distance functions break the quotient regularity needed for such bounds.
-
Generalization Analysis of Transformers in Distribution Regression
Introduces a Transformer framework for distribution regression with a new attention operator enabling lossless compression, proves stronger functional learning than CNNs/FCNs, and provides a generalization bound with ...
Discussion (0). Sign in to comment.