Operator Learning with Gaussian Processes

Operator learning focuses on approximating mappings G^dagger:U rightarrowV between infinite-dimensional spaces of functions, such as u: Omegaurightarrowℝ and v: Omegavrightarrowℝ. This makes it particularly suitable for solving parametric nonlinear partial differential equations (PDEs). While most machine learning methods for operator learning rely on variants of deep neural networks (NNs), recent studies have shown that Gaussian Processes (GPs) are also competitive while offering interpretability and theoretical guarantees. In this paper, we introduce a hybrid GP/NN-based framework for operator learning that leverages the strengths of both methods. Instead of approximating the function-valued operator G^dagger, we use a GP to approximate its associated real-valued bilinear form widetildeG^dagger: U×V^*rightarrowℝ. This bilinear form is defined by widetildeG^dagger(u,varphi) := [varphi,G^dagger(u)], which allows us to recover the operator G^dagger through G^dagger(u)(y)=widetildeG^dagger(u,δy). The GP mean function can be zero or parameterized by a neural operator and for each setting we develop a robust training mechanism based on maximum likelihood estimation (MLE) that can optionally leverage the physics involved. Numerical benchmarks show that (1) it improves the performance of a base neural operator by using it as the mean function of a GP, and (2) it enables zero-shot data-driven models for accurate predictions without prior training. Our framework also handles multi-output operators where G^dagger:U rightarrowprods=1SVs, and benefits from computational speed-ups via product kernel structures and Kronecker product matrix representations.