arXiv Statistics ML

Data-Efficient Kernel Methods for Learning Differential Equations and Their Solution Operators: Algorithms and Error Analysis

arXiv Machine Learning
Jul 30

PIKS: Universal Physics-Informed Kernel Methods

arXiv:2607. 27062v1 Announce Type: cross Abstract: Physics-informed machine learning incorporates physical principles --often expressed via differential operators-- into data-driven models.

By Joachim Bona-Pellissier, Giacomo Meanti, Matteo Santacesaria, Lorenzo Rosasco
arXiv Machine Learning
Sep 4

Data-efficient Kernel Methods for Learning Hamiltonian Systems

The paper introduces kernel-based methods for learning Hamiltonian systems directly from trajectory data, offering both a 2‑step approach (reconstruct trajectories first, then learn the Hamiltonian) and a 1‑step approach (joint inference). Experiments on mass‑spring dynamics, a nonlinear pendulum, and the Henon‑Heiles system show that the methods achieve accurate, data‑efficient predictions, outperforming 2‑step baselines especially when data are scarce, while preserving the Hamiltonian structure. The authors also provide a priori error estimates and a general numerical framework applicable to arbitrary dynamical systems.

By Yasamin Jalalian, Mostafa Samir, Boumediene Hamzi, Peyman Tavallali, Houman Owhadi
arXiv Machine Learning
Sep 17

Fast Learning Rates for Physics-Informed Kernel Methods

arXiv:2609. 18901v1 Announce Type: cross Abstract: In physics-informed machine learning, a target function $u^*$ is learned from noisy value observations $y_i=u^*(x_i)+ \varepsilon_i$, together with differential information, given either by noisy observations $d_j=(Du^*)(z_j)+\xi_j$ or by a known physical constraint $Du^*=v$.

By Luc Brogat-Motte, Joachim Bona-Pellissier, Giacomo Meanti, Lorenzo Rosasco
arXiv Machine Learning
Jun 25

A Zeroth-Order Deep Learning Method for Fully Nonlinear Parabolic Partial Differential Equations with Unknown Coefficients

arXiv:2606. 24999v1 Announce Type: new Abstract: High-dimensional partial differential equations (PDEs) with unknown coefficients arise widely in scientific machine learning, including continuous-time reinforcement learning, yet solving them efficiently in a data-driven way remains challenging.

By Yanwei Jia, Du Ouyang, Huy\^en Pham, Xun Yu Zhou
arXiv Machine Learning
Oct 8

Fluids You Can Trust: Property-Preserving Operator Learning for Incompressible Flows

The paper introduces a kernel‑based operator learning method that preserves key physical properties—such as incompressibility, periodicity, and turbulence—of the incompressible Navier–Stokes equations. By mapping input functions to expansion coefficients in a property‑preserving kernel basis, the method guarantees that predicted velocity fields analytically maintain these properties. The authors provide theoretical convergence guarantees, develop efficient computational techniques for large‑scale training, and demonstrate significant accuracy and speed improvements over neural operators on 2D and 3D flow benchmarks.

By Ramansh Sharma, Matthew Lowery, Houman Owhadi, Varun Shankar
arXiv Machine Learning
Oct 2

Learn-Then-Differentiate Gradient Estimation

Learn-then-differentiate (LTD) estimates gradients by fitting a model to simulation outputs and then differentiating that model. The paper presents a unified framework that explains what LTD differentiates and how accurately it estimates gradients, showing that accuracy guarantees for fitted models translate into guarantees for gradients and higher-order derivatives. The framework recovers known results for kernel regression, local polynomial regression, and kernel ridge regression, and extends to multiple kernel learning and smooth neural networks, providing a common foundation for analyzing LTD across learning methods.

By Nifei Lin, Qingkai Zhang, L. Jeff Hong
arXiv Machine Learning
Aug 27

The Frame Kernel Method for Multiscale Operator Learning

The paper introduces the Frame Kernel Method, a multiscale operator learning approach for surrogate modeling of multiscale partial differential equations. It uses a novel multiscale kernel frame function approximation to cast the learning problem as one of estimating frame coefficients, enabling automatic multiscale decomposition of outputs. The authors provide interpolation proofs, error estimates, and demonstrate that the method outperforms popular neural operators on challenging PDE problems while offering a posteriori multiscale analysis.

By Branden Frieden, Ryan Whitehead, M. Keith Ballard, Robert M. Kirby, Varun Shankar