← Back to all news
arXiv Machine Learning By Janek G\"odeke, Pascal Fernsel

New universal operator approximation theorem for encoder-decoder architectures

Read the original on arXiv Machine Learning →

arXiv:2503. 24092v2 Announce Type: replace-cross Abstract: Motivated by the rapidly growing field of mathematics for operator approximation with neural networks, we present a novel universal operator approximation theorem for broad classes of encoder-decoder architectures and a wide range of input and output spaces.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 15

Resolution-Independent Analysis of Encoder--Decoder Operator Learning via Limiting Kernels

The paper studies operator learning on function spaces using encoder–decoder architectures. It shows that as input and output resolutions grow, the induced kernels converge to a limiting kernel, enabling regularity assumptions independent of resolution. The authors derive upper and lower bounds for regularized stochastic gradient descent, extend the analysis to neural networks via the limiting neural tangent kernel, and provide error bounds and complexity guarantees for various kernel and encoding constructions.

By Lei Shi, Jia-Qi Yang, Ding-Xuan Zhou
More like this →
arXiv AI
Sep 2

Universal Approximation of Nonlinear Operators and Their Derivatives

The paper establishes the first Universal Approximation Theorems for k‑times differentiable nonlinear operators and their derivatives in general Banach spaces, extending classical results to infinite‑dimensional settings. It introduces Derivative‑Informed Operator Learning (DIOL) and formulates Bastiani–Sobolev training for this framework, covering architectures such as DeepONets, Deep‑H‑ONets, and PCA‑Nets. The work also outlines applications to high‑order accuracy in operator learning, constrained optimization in Banach spaces, and numerical methods for infinite‑dimensional PDEs.

By Filippo de Feo
More like this →
arXiv Machine Learning
Sep 4

A Closed-Form Formula for Consistent Lipschitz Regression on Metric Spaces with Sparse Neural Network Realizations

arXiv:2609. 03129v1 Announce Type: cross Abstract: Several classical machine-learning methods, such as KRRs and SVRs, are both computationally and analytically tractable since their estimators either admit closed-form expressions or are obtained by minimizing convex training objectives; neither feature is generally available for deep neural networks.

By Ruiyang Hong, Hrad Ghoukasian, Anastasis Kratsios
llms
More like this →