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

• URL: http://arxiv.org/abs/2609.13798v1
• Date: Sat, 12 Sep 2026 08:19:20 GMT
• Title: Resolution-Independent Analysis of Encoder--Decoder Operator Learning via Limiting Kernels
• Abstract summary: In encoder-decoder architectures, a matrix-valued kernel induces an operator-valued kernel on the original function spaces.<n>As the input and output resolutions increase, the induced kernels converge to a limiting kernel.
• Score: 16.10520704144734
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Operator learning is formulated on function spaces, but training data are typically available only through finite-dimensional representations. In encoder--decoder architectures, a matrix-valued kernel on the encoded space induces an operator-valued kernel on the original function spaces, and the corresponding reproducing kernel Hilbert spaces are isometrically isomorphic. As the input and output resolutions increase, the induced kernels converge to a limiting kernel, in the sense of operator-norm convergence of their associated integral operators, allowing regularity assumptions to be stated independently of the encoding resolution. For regularized stochastic gradient descent, we establish upper bounds for decreasing and fixed step sizes, separating the encoding and regularization terms from optimization terms of order \(t^{-θ}\) and \(T^{-θ'}\), respectively, for any \(θ,θ'\in(0,1)\). We further prove lower bounds showing that these encoding-induced terms are generally unavoidable. The analysis is further extended to encoder--decoder neural networks through the limiting neural tangent kernel (NTK), yielding error bounds with an additional finite-width term and polynomial parameter and sample complexity guarantees when the encoding errors decay algebraically. The framework covers matrix-valued kernels constructed from radial and dot product kernels, NTKs arising from wide encoder--decoder neural networks, and encoder--decoder pairs based on Fourier, Legendre polynomial, wavelet, PCA, or pointwise sampling representations.

Related papers

• Explicit block-encodings for biharmonic boundary-value problems [1.5922179327791923]
  We develop quantum linear-system algorithms for periodic, simply supported, and Dirichlet--Neumann boundary conditions.<n>For Dirichlet--Neumann problems, we introduce a second-order boundary-corrected finite-difference discretization.<n>We also formulate a coupled-Laplace system with additional boundary unknowns.
  arXiv  Detail & Related papers  (2026-07-24T15:20:32Z)
• Efficient Approximation for Encoder--Decoder Neural Operators via Variation Spaces [7.820614736576814]
  We study operator learning using encoder--decoder neural networks.<n>We introduce a variation space as an infinite-dimensional structural class for nonlinear operators.<n>For operators in this space, we establish approximation bounds for encoder--decoder two-layer networks in the Bochner $Lq$ norm.
  arXiv  Detail & Related papers  (2026-05-31T13:53:17Z)
• IKNO: Infinite-order Kernel Neural Operators [57.17011066621087]
  We propose the Infinite-order Kernel Neural Operator (IKNO), which constructs neural operators via infinite-order kernel integrals.<n>We develop two complementary infinite-order neural operator constructions: IKNO-Vanilla, which applies the full- kernel resolvent on the product grid via Kronecker eigendecomposition, and IKNO-TP, an alternative tensor-product operator that composes per-axis resolvents.
  arXiv  Detail & Related papers  (2026-05-21T08:52:36Z)
• FUTON: Fourier Tensor Network for Implicit Neural Representations [56.48739018255443]
  Implicit neural representations (INRs) have emerged as powerful tools for encoding signals, yet dominant-based designs often suffer from slow convergence, overfitting to noise, and poor extrapolation.<n>We introduce FUTON, which models signals as generalized Fourier series whose coefficients are parameterized by a low-rank tensor decomposition.
  arXiv  Detail & Related papers  (2026-02-13T19:31:44Z)
• Generalization Bounds for Transformer Channel Decoders [61.55280736553095]
  This paper studies the generalization performance of ECCT from a learning-theoretic perspective.<n>To the best of our knowledge, this work provides the first theoretical generalization guarantees for this class of decoders.
  arXiv  Detail & Related papers  (2026-01-11T15:56:37Z)
• Scalable Gaussian Processes with Low-Rank Deep Kernel Decomposition [7.532273334759435]
  Kernels are key to encoding prior beliefs and data structures in Gaussian process (GP) models.<n>Deep kernel learning enhances kernel flexibility by feeding inputs through a neural network before applying a standard parametric form.<n>We introduce a fully data-driven, scalable deep kernel representation where a neural network directly represents a low-rank kernel.
  arXiv  Detail & Related papers  (2025-05-24T05:42:11Z)
• Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels [5.663076715852465]
  We investigate regularized convergence encoder descent (SGD) algorithms for estimating nonlinear operators from a Polish space to a separable Hilbert space.<n>We present a new technique for deriving bounds with high probability for general SGD schemes.
  arXiv  Detail & Related papers  (2025-04-25T08:57:38Z)
• Kernel Neural Operators (KNOs) for Scalable, Memory-efficient, Geometrically-flexible Operator Learning [11.165984223900104]
  This paper introduces the Kernel Neural Operator (KNO), a provably convergent operator-learning architecture.<n>The KNO decouples the choice of kernel from the numerical integration scheme (quadrature)<n> Numerical results demonstrate that on existing benchmarks the training and test accuracy of KNOs is comparable to or higher than popular operator learning techniques.
  arXiv  Detail & Related papers  (2024-06-30T19:28:12Z)
• Locality-Aware Generalizable Implicit Neural Representation [54.93702310461174]
  Generalizable implicit neural representation (INR) enables a single continuous function to represent multiple data instances. We propose a novel framework for generalizable INR that combines a transformer encoder with a locality-aware INR decoder. Our framework significantly outperforms previous generalizable INRs and validates the usefulness of the locality-aware latents for downstream tasks.
  arXiv  Detail & Related papers  (2023-10-09T11:26:58Z)
• Multi-Grid Tensorized Fourier Neural Operator for High-Resolution PDEs [93.82811501035569]
  We introduce a new data efficient and highly parallelizable operator learning approach with reduced memory requirement and better generalization. MG-TFNO scales to large resolutions by leveraging local and global structures of full-scale, real-world phenomena. We demonstrate superior performance on the turbulent Navier-Stokes equations where we achieve less than half the error with over 150x compression.
  arXiv  Detail & Related papers  (2023-09-29T20:18:52Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.