Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approcimations
AuthorsShuang Chen, Juncai He, Xue-Cheng Tai
Resources
This paper builds a unified theory showing that neural flow models can approximate both functions and operators, connecting modern continuous-depth networks to residual and plain architectures.
Key results
The main result shows that such operators can be approximated arbitrarily well by R∘FθT∘P with either composition- or separation-structured neural flows.
The paper proves that the universal approximation theorem remains valid when linear dynamics are restricted to convolutional operators.
The well-posedness and approximation results are proved for the parameterized Leaky ReLU family, with ReLU as the special case a = 0.
What the paper found
This paper introduces an abstract neural flow framework that unifies finite-dimensional neural networks and infinite-dimensional neural operators in a single Hilbert-space formulation. The key novelty is the separation of the continuous-depth model into two dynamics: a composition-structured flow, whose explicit Euler discretization recovers ResNet-type architectures, and a separation-structured flow, whose semi-implicit splitting discretization yields plain feedforward architectures. For piecewise-constant parameters and Leaky ReLU activations, the authors prove well-posedness and local Lipschitz dependence of the flow map, then establish what they describe as the first universal approximation theorem for flow-based models between infinite-dimensional spaces: any continuous operator O:C→Y on a compact set C in an abstract Hilbert space can be approximated arbitrarily well by R∘FθT∘P, where P and R are bounded linear maps and FθT is either flow type. They further show that the same result holds under convolutional constraints, by realizing fully connected linear dynamics exactly through constant convolution kernels. Finally, the paper transfers these continuous-time guarantees to finite-depth architectures via time discretization, proving universal approximation for both plain and ResNet-style neural operators, as well as fully connected and convolutional neural networks. The framework includes standard models such as Fourier neural operators, DeepONet, and convolutional neural operators, but its main contribution is the unified flow-based explanation of why these distinct architectures inherit universal approximation power.
Original abstract
We introduce an abstract neural flow framework for neural networks and neural operators. The framework contains two continuous-depth models, namely neural flows with composition and separation structures, and covers both finite-dimensional function approximation and infinite-dimensional operator approximation. We prove well-posedness and universal approximation properties for the corresponding neural flows, including, to the best of our knowledge, the first universal approximation result for flow-based models between infinite-dimensional spaces. We also obtain universal approximation results for convolutional neural flow models. Through suitable time discretizations, the composition structure recovers ResNet-type architectures, while the separation structure, via a splitting-based discretization, yields plain architectures. This gives a unified flow-based route to both residual and plain architectures for neural networks and neural operators with fully connected or convolutional linear layers.
Read the original paperMore in Neural Networks
Browse all 22 papers →End-to-End Hard-Label Cryptanalytic Model Extraction Using Efficient Sign Recovery
Akira Ito, Takayuki Miura, Yosuke Todo
A new query-efficient technique makes it possible to steal the parameters of small black-box neural networks using only their predicted labels.
Retrieving Individual Stems from Music Mixtures with Slot Embeddings
David Braun, Junyi Fan, Pranay Manocha, Donald S. Williamson, Adam Finkelstein
Stembed lets music producers search for individual instrument sounds hidden inside a full song by representing the mixture as multiple searchable stem-like embeddings.
The Linear Representation Hypothesis Needs a Group Action
Louie Hong Yao, Yuhao Li, Shengchao Liu
This paper argues that claims about linear representations only become meaningful once we specify which transformations leave a representation essentially unchanged.