arXiv Machine Learning

Learning dynamical systems from noisy data with Weak-form Kernel Ridge Regression

arXiv:2607. 00257v1 Announce Type: new Abstract: Accurate prediction of complex dynamical systems from noisy measurements remains a significant challenge in scientific computing.

arXiv Machine Learning
Aug 13

A Variational Analysis of Kernel Learning with Learnable Linear Transformations

arXiv:2502. 11665v3 Announce Type: replace-cross Abstract: The classical kernel ridge regression problem aims to find the best fit for the output $Y$ as a function of the input data $X\in \mathbb{R}^d$, with a fixed choice of regularization term imposed by a given choice of a reproducing kernel Hilbert space, such as a Sobolev space.

By Yang Li, Feng Ruan
arXiv Machine Learning
Sep 10

Minimum distance classification for nonlinear dynamical systems

The paper introduces Dynafit, a kernel-based method for classifying trajectories produced by distinct nonlinear dynamical systems. It learns a distance metric by approximating the Koopman operator, enabling classification in a feature space without explicit dimensionality. The authors demonstrate Dynafit on logistic map chaos detection, handwritten dynamical pattern recognition, and visual dynamic texture classification.

By Dominique Martinez
arXiv Machine Learning
Sep 10

Learning Multi-Index Models with Hyper-Kernel Ridge Regression

arXiv:2510.02532v2 Announce Type: replace-cross Abstract: Deep neural networks excel in high-dimensional problems, outperforming models such as kernel methods, which suffer from the curse of dimensio...

By Shuo Huang, Hippolyte Labarri\`ere, Ernesto De Vito, Tomaso Poggio, Lorenzo Rosasco
arXiv Machine Learning
Sep 2

A Compositional Kernel Model for Feature Learning

The paper introduces a compositional variant of kernel ridge regression where the predictor reweights input coordinates, framing the approach as a variational problem to study feature learning in compositional architectures. It demonstrates that both global minimizers and stationary points can discard Gaussian noise variables while retaining relevant ones, and shows that α1-type kernels (e.g., Laplace) recover features contributing to nonlinear effects at stationary points, whereas Gaussian kernels recover only linear ones.

By Feng Ruan, Keli Liu, Michael Jordan
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