Kernel Methods for Learning Operators with Multiple Inputs and Outputs

• URL: http://arxiv.org/abs/2608.11831v1
• Date: Wed, 12 Aug 2026 09:15:20 GMT
• Title: Kernel Methods for Learning Operators with Multiple Inputs and Outputs
• Abstract summary: We introduce a kernel-based encoder-decoder framework for operator learning that separates observation, representation, learning, and reconstruction.<n>We develop this framework for multi-input, multi-output operator learning, where operators map between products of potentially distinct function spaces.<n>We specialize the approach to multiple operator learning by introducing KernelMO, a family of kernel methods with complementary operator-valued and product-space formulations.
• Score: 0.5249805590164902
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning mappings between infinite-dimensional objects is a central challenge in scientific machine learning. We introduce a general kernel-based encoder-decoder framework for operator learning that separates observation, representation, learning, and reconstruction. We develop this framework for multi-input, multi-output operator learning, where operators map between products of potentially distinct function spaces. Our approximation theory shows that, although the number of inputs and outputs can increase, the convergence rate is governed by the most challenging constituent approximation problem rather than the overall problem dimension. The framework leads to practical kernel methods with closed-form training and inference, combining mathematical tractability with computational efficiency. We further specialize the approach to multiple operator learning by introducing KernelMO, a family of kernel methods with complementary operator-valued and product-space formulations. Across five families of parametric partial differential equations, the proposed methods achieve competitive or state-of-the-art predictive accuracy while reducing training and inference costs relative to neural operator architectures and deep learning based models, offering an efficient and lightweight alternative.

Related papers

• Multi-stage neural operator learning with application for convolutions [4.1727004663626905]
  This paper introduces two general multi-stage neural operator learning frameworks.<n>The first, Deep Collocation Neural Operator (DCNO), is a supervised approach that iteratively refines the operator approximation by learning residuals from input-output data pairs.<n>The second, Deep Galerkin Neural Operator (DGNO), is an unsupervised framework applicable when the target operator can be represented by a PDE, leveraging the weak form of the PDE residual for training.
  arXiv  Detail & Related papers  (2026-08-19T12:23:20Z)
• Convergence Rates for Learning Pseudo-Differential Operators [1.1559118525005183]
  We formulate learning over elliptic pseudo-differential operators as a structured infinite-dimensional regression problem with multiscale sparsity.<n>We show that the learned operator induces an efficient and stable Galerkin solver whose numerical error matches its statistical accuracy.<n>Our results contribute to bringing together operator learning, data-driven solvers, and wavelet methods in scientific computing.
  arXiv  Detail & Related papers  (2026-01-08T01:21:08Z)
• Fourier Neural Operators Explained: A Practical Perspective [75.12291469255794]
  The Fourier Neural Operator (FNO) has become the most influential and widely adopted due to its elegant spectral formulation.<n>This guide aims to establish a clear and reliable framework for applying FNOs effectively across diverse scientific and engineering fields.
  arXiv  Detail & Related papers  (2025-12-01T08:56:21Z)
• Cauchy Random Features for Operator Learning in Sobolev Space [9.616322090804436]
  We propose a random feature operator learning method with theoretical guarantees and error bounds.<n>Compared to kernel-based method and neural network methods, the proposed method can obtain similar or better test errors.
  arXiv  Detail & Related papers  (2025-03-01T02:14:25Z)
• 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)
• Neural Operators with Localized Integral and Differential Kernels [77.76991758980003]
  We present a principled approach to operator learning that can capture local features under two frameworks. We prove that we obtain differential operators under an appropriate scaling of the kernel values of CNNs. To obtain local integral operators, we utilize suitable basis representations for the kernels based on discrete-continuous convolutions.
  arXiv  Detail & Related papers  (2024-02-26T18:59:31Z)
• An Introduction to Kernel and Operator Learning Methods for Homogenization by Self-consistent Clustering Analysis [0.48747801442240574]
  The article presents a thorough analysis on the mathematical underpinnings of the operator learning paradigm. The proposed kernel operator learning method uses graph kernel networks to come up with a mechanistic reduced order method for multiscale homogenization.
  arXiv  Detail & Related papers  (2022-12-01T02:36:16Z)
• A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms [64.3064050603721]
  We generalize Runge-Kutta neural network to a recurrent neural network (R2N2) superstructure for the design of customized iterative algorithms. We demonstrate that regular training of the weight parameters inside the proposed superstructure on input/output data of various computational problem classes yields similar iterations to Krylov solvers for linear equation systems, Newton-Krylov solvers for nonlinear equation systems, and Runge-Kutta solvers for ordinary differential equations.
  arXiv  Detail & Related papers  (2022-11-22T16:30:33Z)
• Linear Self-Attention Approximation via Trainable Feedforward Kernel [77.34726150561087]
  In pursuit of faster computation, Efficient Transformers demonstrate an impressive variety of approaches. We aim to expand the idea of trainable kernel methods to approximate the self-attention mechanism of the Transformer architecture.
  arXiv  Detail & Related papers  (2022-11-08T08:14:11Z)
• Inducing Gaussian Process Networks [80.40892394020797]
  We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points. The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains. We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-21T05:27:09Z)
• Neural Operator: Learning Maps Between Function Spaces [75.93843876663128]
  We propose a generalization of neural networks to learn operators, termed neural operators, that map between infinite dimensional function spaces. We prove a universal approximation theorem for our proposed neural operator, showing that it can approximate any given nonlinear continuous operator. An important application for neural operators is learning surrogate maps for the solution operators of partial differential equations.
  arXiv  Detail & Related papers  (2021-08-19T03:56:49Z)

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.