cs.LGApr 3, 2025

On shallow feedforward neural networks with inputs from a topological space

Authors: Vugar Ismailov

Organizations: Institute of Mathematics and Mechanics, Baku, Azerbaijan · Center for Mathematics and its Applications, Khazar University, Baku, Azerbaijan

Abstract

We study feedforward neural networks with inputs from a topological space (TFNNs). We prove a universal approximation theorem for shallow TFNNs, which demonstrates their capacity to approximate any continuous function defined on this topological space. As an application, we obtain an approximative version of Kolmogorov's superposition theorem for compact metric spaces.

Explore similar work

May 20, 2026

Approximation Theory for Neural Networks: Old and New

Universal approximation theorems provide a mathematical explanation for the expressive power of neural networks. They assert that, under mild conditions on the activation function, feedforward neural networks are dense in broad function classes, such as continuous functions on compact subsets of Rd\mathbb{R}^d, LpL^p spaces, or Sobolev spaces. Over the past four decades, these qualitative universality results have evolved into a rich quantitative theory addressing approximation rates, parameter efficiency, and the role of architectural features such as depth and width. This survey presents several glimpses into this theory. We review classical density results for single-hidden-layer networks, as well as quantitative bounds that relate approximation error to network size and smoothness assumptions on target functions. Particular emphasis is placed on depth--width trade-offs and on results demonstrating that deeper architectures can achieve superior parameter efficiency for structured function classes. In addition to standard feedforward neural networks, we also review recent developments on Kolmogorov--Arnold Networks (KANs), which offer an alternative architectural paradigm and whose approximation-theoretic properties have begun to attract significant theoretical attention.
Mar 12, 2026

Topological DeepONets and a generalization of the Chen-Chen operator approximation theorem

Deep Operator Networks (DeepONets) provide a branch-trunk neural architecture for approximating nonlinear operators acting between function spaces. In the classical operator approximation framework, the input is a function u∈C(K1)u\in C(K_1) defined on a compact set K1K_1 (typically a compact subset of a Banach space), and the operator maps uu to an output function G(u)∈C(K2)G(u)\in C(K_2) defined on a compact Euclidean domain K2⊂RdK_2\subset\mathbb{R}^d. In this paper, we develop a topological extension in which the operator input lies in an arbitrary Hausdorff locally convex space XX. We construct topological feedforward neural networks on XX using continuous linear functionals from the dual space X∗X^* and introduce topological DeepONets whose branch component acts on XX through such linear measurements, while the trunk component acts on the Euclidean output domain. Our main theorem shows that continuous operators G:V→C(K;Rm)G:V\to C(K;\mathbb{R}^m), where V⊂XV\subset X and K⊂RdK\subset\mathbb{R}^d are compact, can be uniformly approximated by such topological DeepONets. This extends the classical Chen-Chen operator approximation theorem from spaces of continuous functions to locally convex spaces and yields a branch-trunk approximation theorem beyond the Banach-space setting.
Oct 10, 2025

Distributionally robust approximation property of neural networks

The universal approximation property uniformly with respect to weakly compact families of measures is established for several classes of neural networks. To that end, we prove that these neural networks are dense in Orlicz spaces, thereby extending classical universal approximation theorems even beyond the traditional LpL^p-setting. The covered classes of neural networks include widely used architectures like feedforward neural networks with non-polynomial activation functions, deep narrow networks with ReLU activation functions and functional input neural networks.