On the universal approximation property of radial basis function neural networks
Not on the map. Why?
Abstract (arXiv)
In this paper we consider a new class of RBF (Radial Basis Function) neural networks, in which smoothing factors are replaced with shifts. We prove under certain conditions on the activation function that these networks are capable of approximating any continuous multivariate function on any compact subset of the d-dimensional Euclidean space. For RBF networks with finitely many fixed centroids we describe conditions guaranteeing approximation with arbitrary precision.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 0 of its 25 references that are in the map. First posted on arXiv 5 Apr 2023.
Builds on
0 of 25 references.
No references here yet.
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2026Free-RBF-KAN: Kolmogorov-Arnold Networks with Adaptive Radial Basis Functions for Efficient Function Learningcited by 2
- 2025Approximating Signed Distance Fields With Sparse Ellipsoidal Radial Basis Function Networks: A Dynamic Multi-Objective Optimization Strategycited by 0
- 2025Deep Neural Network-Driven Adaptive Filteringcited by 0
- 2026Free-RBF-KAN: Kolmogorov-Arnold Networks with Adaptive Radial Basis Functions for Efficient Function Learning12 Jan 2026
- 2025Deep Neural Network-Driven Adaptive Filtering6 Aug 2025
- 2025Approximating Signed Distance Fields With Sparse Ellipsoidal Radial Basis Function Networks: A Dynamic Multi-Objective Optimization Strategy5 May 2025