Skip to content
Preprint

Kernel Methods for Learning Operators with Multiple Inputs and Outputs

Aug 2026 · 0 citations
Computer Science Mathematics

TL;DR

This work introduces a general kernel-based encoder-decoder framework for operator learning that separates observation, representation, learning, and reconstruction, and develops this framework for multi-input, multi-output operator learning, where operators map between products of potentially distinct function spaces.

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.

View source

Similar papers

Preprint Aug 2026

Multi-stage neural operator learning with application for convolutions

Two general multi-stage neural operator learning frameworks applicable when the target operator can be represented by a PDE, leveraging the weak form of the PDE residual for training are introduced.

Zhiping Mao, Zhenye Wen, Yong Zhang et al. · 0 citations
Preprint Aug 2026

Tensor Network Kernel Machines: A JAX Framework for Machine Learning and Nonlinear System Identification

Developing nonlinear models that are both expressive and computationally efficient remains a challenge in machine learning and nonlinear system identification. Tensor network kernel machines (TNKM) address this challenge by combining nonlinear feature representations with compact low-rank tensor-network parameterizatio...

Albert Saiapin, Kim Batselier · 0 citations
Jul 2026

Kernel-based Operator Learning: Error Analysis, Budget Allocation, and a Physics-Informed Extension

An explicit budget allocation condition is derived from a coupled error analysis that interprets the surrogate as a reconstruction from approximate data and yields a decomposition of the total error into reconstruction and learning contributions that can be analyzed independently.

Rüdiger Kempf · 0 citations
Preprint Aug 2026

Operator-Theoretic Generalization Bounds for Multitask Deep Learning

Operator-theoretic generalization bounds for deep multi-output function classes are developed by representing network layers as Koopman composition operators on vector-valued reproducing kernel Hilbert spaces and derive Rademacher complexity bounds for invertible and width-expanding injective architectures.

Mahdi Mohammadigohari, Thomas Borsani, G. Di Fatta · 1 citation
Preprint Aug 2026

Beyond the Gegenbauer Paradigm: q-Orthogonal Kernels for Machine Learning

This work extends the orthogonal polynomial kernel paradigm by introducing a novel family based on discrete Hermite I polynomials, a class of $q$-orthogonal polynomials that generalize classical Hermite polynomials through a deformation parameter $q$.

Álvaro Sánchez-Paniagua Ríos, J. P. Llerena, Alberto Lastra et al. · 0 citations
Jul 2026

PIKS: Universal Physics-Informed Kernel Methods

The universal consistency of PIKS is established for linear differential constraints, proving that for universal kernels (such as Gaussian or Mat\'ern), the estimator asymptotically learns the target while satisfying physical constraints.

Joachim Bona-Pellissier, Giacomo Meanti, Matteo Santacesaria et al. · 1 citation

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