Skip to content

The Frame Kernel Method for Multiscale Operator Learning

Aug 2026 · 0 citations · 62 references
Computer Science Mathematics

TL;DR

The new multiscale frame kernel method is significantly more accurate than popular neural operators on challenging problems from the literature, while simultaneously admitting an a posteriori multiscale decomposition upon generalization.

Abstract

We present a natively multiscale operator learning method for the surrogate modeling of (numerical solvers for) multiscale partial differential equations (PDEs). The primary novelty of our method lies in a novel multiscale kernel frame function approximation technique. Leveraging this new kernel frame technique, we cast the operator learning problem as one of learning frame coefficients of output functions as a function of frame coefficients of input functions. The generalization step then automatically allows for a multiscale decomposition of the output functions. Our method is applicable to both tensor-product grids and point clouds. We present interpolation proofs, error estimates, and numerical convergence rates for our frame approximation. We the demonstrate the applicability of our method for the surrogate modeling of inherently multiscale PDEs. The new multiscale frame kernel method is significantly more accurate than popular neural operators on challenging problems from the literature, while simultaneously admitting an a posteriori multiscale decomposition upon generalization.

View source

Similar papers

Preprint Sep 2026

Anisotropic Kernel-based Multilevel Interpolation of High-Dimensional Functions on Sparse Grids

Using a recent nodal representation of the low-dimensional multilevel operators, an explicit, computable representation of the high-dimensional interpolant is derived, and the full range of anisotropy weights that attain the optimal rate against the number of degrees of freedom are characterised.

Rüdiger Kempf · 0 citations
Preprint Oct 2026

Efficient localised model reduction for multiscale PDEs via Grassmannian interpolation

A geometric interpolation approach within the multiscale generalized finite element method (MS-GFEM) that targets the most expensive component: computing parameter-dependent optimal local approximation spaces and inherits the nearly exponential spatial convergence of MS-GFEM and the parametric convergence rates of spar...

C. Alber, Markus Bachmayr, Robert Scheichl et al. · 0 citations
Sep 2026

Optimal Recovery for Solving Variational Problems

In science and engineering, many physical laws and scientific principles naturally arise as variational problems of minimizing an energy functional over an appropriate functional space. In many cases, it is more advantageous to directly discover the minimizer of the energy functional than to solve the associated Euler-...

Ting Wang, Gideon Simpson, Jaroslaw Knap · 0 citations
Aug 2026

A Neural-network-based multiscale Hybridizable Discontinuous Galerkin method for solving PDEs in porous media

A neural-network-accelerated multiscale hybridizable discontinuous Galerkin method for elliptic problems with heterogeneous coefficients demonstrating the potential of neural surrogates for accelerating multiscale HDG computations while also highlighting the need for improved operator representations and a better under...

Tony Haines, Ke Shi · 0 citations
Sep 2026

A Weighted Kernel Method for Approximation that Adapts to Learned Multivariable Structure

This work introduces total sensitivity kernels (TSKs), a method based on families of weighted ANOVA kernels that learn and adapt to this multivariable structure, and establishes consistency of a finite-data formulation based on minimum-norm interpolation.

John E. Darges, Laura Weidensager · 0 citations
Preprint Oct 2026

A Physics-Driven Multiscale Method for High-Frequency Helmholtz Equations

We develop and analyze a physics-driven multiscale method for model reduction of the Helmholtz equation at high frequency. The method constructs a reduced approximation space from local wave responses within a mixed finite element formulation with velocity elimination. These responses are computed by solving Helmholtz...

Huang-Xin Chen, Jian-Hui Chen, Shu-Bin Fu et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

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