Skip to content
Preprint

Uniform Approximation for Operator Learning on Compact Sets

Oct 2026 · 0 citations · 69 references
Mathematics Computer Science

TL;DR

It is proved that nonlinear recovery with a common vanishing gauge and a rank bound depending only on the model dimension is equivalent to the uniform approximation property (UAP).

Abstract

We study uniform approximation for operator learning on compact subsets of Banach spaces. We bound the recovery dimensions and the number of network parameters in terms of compact-set complexity, the target gauge, and recovery stability. For bounded linear operators with a separable domain, we characterize gauge approximability by coordinate decompositions with a common vanishing gauge and arbitrarily small additive errors. Their partial sums give a fixed family of nonlinear encoder--decoder pairs. We prove that nonlinear recovery with a common vanishing gauge and a rank bound depending only on the model dimension is equivalent to the uniform approximation property (UAP). We also obtain linear recovery estimates with the same rank bound and an operator version for the linear factors of nonlinear targets. For Barron operators taking values in a Banach space $Y$ of type $p\in(1,2]$ and admitting a Bochner-integrable density, sampling gives the rate $N^{-(1-1/p)}$ for the expected $L^p(\lambda;Y)$ error, where $\lambda$ is a probability measure on the input compact set. For fixed finite-dimensional factors and a class of H\"older maps, we obtain matching upper and lower parameter bounds at fixed sufficiently large depth. Classical sampling and truncation examples provide explicit recovery maps, and a nonlinear integral operator illustrates the parameter bounds.

View source

Similar papers

Preprint Oct 2026

Minimax Operator Learning for Holomorphic Maps between Hilbert Spaces

We consider the problem of learning nonlinear operators $G_0: \mathcal X\to \mathcal Y$ from finitely many noisy observations. While finite-regularity classes such as Lipschitz- or $C^k$-operators suffer from the curse of sample complexity (i.e. algebraic sample complexity is impossible), algebraic convergence rates ca...

Ly Duc Hoang, Sven Wang, Jakob Zech · 0 citations
Preprint Oct 2026

Gaussian Approximation of Besov Functions for Logistic Classification on Manifolds

We study Gaussian kernel approximation and regularized logistic classification on a connected compact smooth embedded manifold $X\subset\mathbb R^d$ without boundary and of intrinsic dimension $\varrho$. Two main challenges are to derive a fast oracle inequality without assuming a bounded Bayes function and to construc...

Guan-Hang Lei, Lei Shi, Xiao-Ming Yuan · 0 citations
Preprint Sep 2026

The Stability and Density of Norm Attaining Operators on Reducing Subspaces

For a bounded linear operator on an infinite-dimensional Hilbert space, we consider the class $\beta(H)$ of operators whose restrictions to all nonzero reducing subspaces attain their norms. We prove that $\beta(H)$ is dense in $\mathcal{B}(H)$ in the operator norm. Since $\beta(H)$ is not stable under arbitrary compac...

Zi-Nan Su, Yuan-Hang Zhang · 0 citations
Preprint Sep 2026

Approximating Smooth Functionals with ReLU Networks

This is the first work to characterize neural network approximation error for infinite-dimensional functional inputs explicitly through the joint dimensional decay of coordinate magnitudes and directional sensitivities.

Shu-Hao Jiao · 0 citations
Preprint Sep 2026

Greedy sampling designs via reduced basis methods: optimal recovery in the uniform norm

We study optimal sampling recovery in reproducing kernel Hilbert spaces (RKHS) in the uniform norm. For every RKHS with bounded kernel, we establish new comparisons between linear sampling widths and Gelfand widths that overcome the known square-root gap, without requiring a measure or a Christoffel-type condition. Our...

S. Neumayer, K. Pozharska, T. Ullrich · 1 citation · ⚡1
Preprint Oct 2026

Bounded symbols and one-component geometry

We prove that every bounded truncated Toeplitz operator on a Hardy model space admits a bounded symbol if and only if its defining inner function is one-component, meaning that it has a connected sublevel set at some level in $(0,1)$. This resolves the bounded symbol conjecture of Baranov, Chalendar, Fricain, Mashreghi...

Sam Looi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.