mlsanityData to 14 Oct 2026

Low-Rank Kolmogorov-Arnold Generator Flows for Interpretable Operator Learning

arXiv 2610.13028 ↗First posted 9 Oct 2026cs.LG physics.comp-phcited by 0

Not on the map. Why?

Abstract (arXiv)

Neural operators that learn physical laws from data should generalize beyond their training distribution and expose the learned law in closed form. The Kolmogorov-Arnold neural operator achieves both for position-dependent dynamics by learning a dense pseudo-differential symbol over all positions and frequencies, at a cost that grows with the square of the resolution and with closed forms that must be read out by hand. This dense symbol is unnecessary: a finite-order variable-coefficient differential operator has a symbol whose separation rank is bounded by the number of its coefficient functions, independently of the resolution, and the symbols that this network learns on its own benchmarks have rank two. We introduce the Kolmogorov-Arnold flow (KAFlow), which learns the generator of a physical operator as a low-rank symbol built from univariate Kolmogorov-Arnold functions, fixes the gauge of these functions so that every term has a unique place, integrates the dynamics with exact exponential integrators, and distills its closed form automatically. On the synthetic benchmarks of the Kolmogorov-Arnold neural operator, KAFlow lowers the out-of-distribution loss by 3.4 to 11 times and recovers every coefficient to within 10^-4 without symbolic templates, reaching the precision floor of the data. On long-horizon quantum dynamics, it lowers the state infidelity by up to 6 orders of magnitude, and by 30 times when trained only on position and momentum measurements. KAFlow also learns a variable-order fractional operator 15 times more accurately than existing operator networks and discovers nonlocal, fractional and non-polynomial dispersion relations on which sparse regression fails.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 40 references that are in the map. First posted on arXiv 9 Oct 2026.

Builds on

18 of 40 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
  3. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 2,018
  4. 2017PDE-Net: Learning PDEs from Datacited by 311
  5. 2021U-FNO -- An enhanced Fourier neural operator-based deep-learning model for multiphase flowcited by 297
  6. 2018PDE-Net 2.0: Learning PDEs from Data with A Numeric-Symbolic Hybrid Deep Networkcited by 210
  7. 2020Weak SINDy For Partial Differential Equationscited by 155
  8. 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 118
  9. 2021PySINDy: A comprehensive Python package for robust sparse system identificationcited by 89
  10. 2024DeepOKAN: Deep Operator Network Based on Kolmogorov Arnold Networks for Mechanics Problemscited by 84
  11. 2024KAN-ODEs: Kolmogorov-Arnold Network Ordinary Differential Equations for Learning Dynamical Systems and Hidden Physicscited by 59
  12. 2025A Practitioner's Guide to Kolmogorov-Arnold Networkscited by 18
6 more
  1. 2022Pseudo-Differential Neural Operator: Generalized Fourier Neural Operator for Learning Solution Operators of Partial Differential Equationscited by 8
  2. 2025KANO: Kolmogorov-Arnold Neural Operatorcited by 7
  3. 2025EFKAN: A KAN-Integrated Neural Operator For Efficient Magnetotelluric Forward Modelingcited by 4
  4. 2026Symbolic--KAN: Kolmogorov-Arnold Networks with Discrete Symbolic Structure for Interpretable Learningcited by 4
  5. 2026SINDy-KANs: Sparse identification of non-linear dynamics through Kolmogorov-Arnold networkscited by 3
  6. 2026Neural Discovery of Memory and Nonlocal Kernels in Integro-Differential Equations with Constrained Kolmogorov--Arnold Networkscited by 1

Built on by

Not cited yet.