English
Related papers

Related papers: Universal approximation results for neural network…

200 papers

We describe generalizations of the universal approximation theorem for neural networks to maps invariant or equivariant with respect to linear representations of groups. Our goal is to establish network-like computational models that are…

Neural and Evolutionary Computing · Computer Science 2018-04-30 Dmitry Yarotsky

In this paper, a universal approximation theorem (UAT) for shallow neural networks whose inputs belong to a topological vector space (TVS) and whose outputs take values in a Hausdorff locally convex TVS is established. The networks are…

Functional Analysis · Mathematics 2026-03-10 Sachin Saini

This paper develops simple feed-forward neural networks that achieve the universal approximation property for all continuous functions with a fixed finite number of neurons. These neural networks are simple because they are designed with a…

Machine Learning · Computer Science 2022-10-10 Zuowei Shen , Haizhao Yang , Shijun Zhang

We study the approximation of shift-invariant or equivariant functions by deep fully convolutional networks from the dynamical systems perspective. We prove that deep residual fully convolutional networks and their continuous-layer…

Machine Learning · Computer Science 2023-05-19 Ting Lin , Zuowei Shen , Qianxiao Li

Modifications to a neural network's input and output layers are often required to accommodate the specificities of most practical learning tasks. However, the impact of such changes on architecture's approximation capabilities is largely…

Machine Learning · Computer Science 2020-11-10 Anastasis Kratsios , Eugene Bilokopytov

In this paper, we prove that a shallow neural network with a monotone sigmoid, ReLU, ELU, Softplus, or LeakyReLU activation function can arbitrarily well approximate any L^p(p>=2) integrable functions defined on R*[0,1]^n. We also prove…

Machine Learning · Computer Science 2021-10-12 Ming-Xi Wang , Yang Qu

Complex-valued neural networks (CVNNs) have recently shown promising empirical success, for instance for increasing the stability of recurrent neural networks and for improving the performance in tasks with complex-valued inputs, such as in…

Functional Analysis · Mathematics 2023-10-31 Paul Geuchen , Felix Voigtlaender

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…

Machine Learning · Computer Science 2023-04-11 Aysu Ismayilova , Muhammad Ismayilov

We investigate the approximation capabilities of dense neural networks. While universal approximation theorems establish that sufficiently large architectures can approximate arbitrary continuous functions if there are no restrictions on…

Machine Learning · Computer Science 2026-05-19 Levi Rauchwerger , Stefanie Jegelka , Ron Levie

We study feedforward neural networks with inputs from a topological vector space (TVS-FNNs). Unlike traditional feedforward neural networks, TVS-FNNs can process a broader range of inputs, including sequences, matrices, functions and more.…

Machine Learning · Computer Science 2024-09-20 Vugar Ismailov

This paper investigates the universal approximation capabilities of Hamiltonian Deep Neural Networks (HDNNs) that arise from the discretization of Hamiltonian Neural Ordinary Differential Equations. Recently, it has been shown that HDNNs…

Machine Learning · Computer Science 2023-05-31 Muhammad Zakwan , Massimiliano d'Angelo , Giancarlo Ferrari-Trecate

In this paper we study shallow neural network functions which are linear combinations of compositions of activation and quadratic functions, replacing standard affine linear functions, often called neurons. We show the universality of this…

Numerical Analysis · Mathematics 2022-05-12 Leon Frischauf , Otmar Scherzer , Cong Shi

In this short note, we give an elementary proof of a universal approximation theorem for neural networks with three hidden layers and increasing, continuous, bounded activation function. The result is weaker than the best known results, but…

Machine Learning · Computer Science 2024-12-24 Chris Monico

We consider multivariate splines and show that they have a random feature expansion as infinitely wide neural networks with one-hidden layer and a homogeneous activation function which is the power of the rectified linear unit. We show that…

Machine Learning · Computer Science 2023-03-02 Francis Bach

We introduce a Banach space-valued extension of random feature learning, a data-driven supervised machine learning technique for large-scale kernel approximation. By randomly initializing the feature maps, only the linear readout needs to…

Machine Learning · Computer Science 2026-04-28 Ariel Neufeld , Philipp Schmocker

This paper presents two main theoretical results concerning shallow neural networks with ReLU$^k$ activation functions. We establish a novel integral representation for Sobolev spaces, showing that every function in…

Numerical Analysis · Mathematics 2025-05-13 Xinliang Liu , Tong Mao , Jinchao Xu

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Complex Variables · Mathematics 2025-06-26 Stéphane Charpentier , Konstantinos Maronikolakis

This article is concerned with the approximation and expressive powers of deep neural networks. This is an active research area currently producing many interesting papers. The results most commonly found in the literature prove that neural…

Machine Learning · Computer Science 2019-05-08 I. Daubechies , R. DeVore , S. Foucart , B. Hanin , G. Petrova

For the past 30 years or so, machine learning has stimulated a great deal of research in the study of approximation capabilities (expressive power) of a multitude of processes, such as approximation by shallow or deep neural networks,…

Machine Learning · Computer Science 2025-01-07 Hrushikesh Mhaskar

We prove several universal approximation results at minimal or near-minimal width for approximation of $L^p(\mathbb{R}^{d_x}, \mathbb{R}^{d_y})$ and $C^0(\mathbb{R}^{d_x}, \mathbb{R}^{d_y})$ on compact sets. Our approach uses a unified…

Neural and Evolutionary Computing · Computer Science 2025-12-29 Dennis Rochau , Robin Chan , Hanno Gottschalk