Superiority of GNN over NN in generalizing bandlimited functions

06/13/2022
by   A. Martina Neuman, et al.
0

We constructively show, via rigorous mathematical arguments, that GNN architectures outperform those of NN in approximating bandlimited functions on compact d-dimensional Euclidean grids. We show that the former only need ℳ sampled functional values in order to achieve a uniform approximation error of O_d(2^-ℳ^1/d) and that this error rate is optimal, in the sense that, NNs might achieve worse.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2017

Achieving the time of 1-NN, but the accuracy of k-NN

We propose a simple approach which, given distributed computing resource...
research
11/13/2019

Approximation by Exponential Type Neural Network Operators

In the present article, we introduce and study the behaviour of the new ...
research
08/18/2021

Predicting Dynamic Stability of Power Grids using Graph Neural Networks

The prediction of dynamical stability of power grids becomes more import...
research
06/17/2008

Supervised functional classification: A theoretical remark and some comparisons

The problem of supervised classification (or discrimination) with functi...
research
05/29/2023

Minimum Width of Leaky-ReLU Neural Networks for Uniform Universal Approximation

The study of universal approximation properties (UAP) for neural network...
research
01/31/2023

Complete Neural Networks for Euclidean Graphs

We propose a 2-WL-like geometric graph isomorphism test and prove it is ...

Please sign up or login with your details

Forgot password? Click here to reset