Overview

Universal approximation asks when neural networks and related models can approximate target functions, operators, or probability transformations, a prerequisite for learning what those models can express. Common approaches prove density under conditions on activation functions and depth, derive error rates for smoothness classes, and study architectures such as residual networks, invariant models, Kolmogorov–Arnold networks, and signature-based models. Results now extend beyond compact finite-dimensional domains to derivatives, path-dependent processes, variable-size sets, partial differential equations, and measure-valued maps. A central tension is that universality may fail or require substantial resources under restrictions such as narrow architectures, small embeddings, atomic inputs, finite precision, or physical noise, making quantitative and practical guarantees important open concerns.

Latest papers

32 papers3 papers in the last four weeks, level with the four weeks before. 0.0% of all new papers.

Sep 23, 2025

Re-uploading quantum data: a universal function approximator for quantum inputs

Quantum data re-uploading has proved powerful for classical inputs, where repeatedly encoding features into a small circuit yields universal function approximation. Extending this idea to quantum inputs remains underexplored, as the information contained in a quantum state is not directly accessible in classical form. We propose and analyze a quantum data re-uploading architecture in which a qubit interacts sequentially with fresh copies of an arbitrary input state. The circuit can approximate any bounded continuous function using only one ancilla qubit and single-qubit measurements, provided that sufficiently many copies of the input state and, in general, sufficiently many layers are available. By alternating entangling unitaries with mid-circuit resets of the input register, the architecture realizes a discrete cascade of completely positive and trace-preserving maps, analogous to collision models in open quantum system dynamics. Our framework provides a space-efficient and expressive approach to designing quantum machine learning models that operate directly on quantum data.
Apr 3, 2025

On shallow feedforward neural networks with inputs from a topological space

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.