Speaker
Abstract
Statistical learning theory measures capacity by smoothness. This talk develops an alternative in which compressibility plays that role, using kernel methods as the bridge between machine learning, dynamical systems, and algorithmic information theory (AIT).
A reproducing kernel is a measure of similarity, and therefore of compressibility. This observation yields Kolmogorov-complexity and Solomonoff kernels: bona fide Mercer kernels whose geometry is algorithmic. Because these are genuine reproducing kernels, the classical apparatus applies and the three universal spectral regimes of Cucker–Smale–Zhou (CSZ) are inherited. Complexity is then tied to that spectrum, and this is what converts the inherited CSZ regimes into complexity conditions rather than smoothness conditions.
Kernel selection then becomes Occam's razor made computable. Learning kernels from data using Sparse Kernel Flows is recovered as consistent with the MDL principle.
KC and Solomonoff kernels also allow us to construct Solomonoff Gaussian processes: Gaussian processes whose covariance is itself a Kolmogorov-complexity or Solomonoff kernel, so that the associated RKHS, which we call the Solomonoff Gaussian Hilbert Space, is one in which regularity means compressibility and algorithmic simplicity is encoded directly in the prior. These approximate Solomonoff induction: the right balance between Epicurus' principle of multiple explanations - retain every hypothesis consistent with the data - and Occam's razor, obtained by weighting each hypothesis by 2^(−K), so that all candidates survive but the simplest dominate exponentially.
We then argue that simplification in dynamical systems is already an algorithmic-information statement. We show that standard simplifying transformations are consistent with the MDL principle: the Cole-Hopf transformation, which takes Burgers' equation to the heat equation, and Poincaré normal-form reduction for the Brusselator ODE and for the Moore-Greitzer PDE.
Koopman is the part of the programme still under consideration, and we conjecture more broadly that spectral results in Koopman theory are statements about compression, in the same way that, for function approximation from random samples, the three Cucker–Smale–Zhou spectral regimes were reformulated as statements about compression from an AIT perspective.
References
- Hamzi, Hutter. Toward an Algorithmic Theory of Machine Learning: Unifying Machine Learning and Algorithmic Information Theory via Kernel Methods. ResearchGate publication 411158923. https://www.researchgate.net/publication/411158923
- Hamzi, Hutter, Owhadi. Bridging Algorithmic Information Theory and Machine Learning: A new approach to kernel learning. Physica D 468 (2024) 134153, https://www.sciencedirect.com/science/article/abs/pii/S0167278924001040
- Hamzi, Owhadi, Hutter. Bridging AIT and ML, Part II: Clustering and density estimation in unsupervised learning. Published as Bridging AIT and ML: Clustering, density estimation, Kolmogorov complexity-based kernels, and kernel learning in unsupervised learning, Physica D (2025), https://www.sciencedirect.com/science/article/abs/pii/S0167278925001484
- Hamzi, Hutter, Owhadi. Bridging AIT and ML, Part III. Published as Learning Theory from the Viewpoint of Algorithmic Information Theory: Kolmogorov Complexity Meets Kernel Methods. ResearchGate, https://www.researchgate.net/publication/394846987_Learning_Theory_from_the_Viewpoint_of_Algorithmic_Information_Theory_Kolmogorov_Complexity_Meets_Kernel_Methods
- Hamzi, Hutter, Owhadi, Wilson. Bridging AIT and ML, Part IV: Solomonoff Gaussian Hilbert Spaces, Solomonoff Gaussian Processes, and Solomonoff Gaussian Fields. Physica D (2026), https://www.sciencedirect.com/science/article/abs/pii/S0167278926002678?via%3Dihub
- Hamzi, Hutter, Owhadi, Wilson. Bridging AIT and ML, Part V: Learning Theory in Solomonoff Gaussian Hilbert Spaces. ResearchGate (2026), https://www.researchgate.net/publication/402794637_Bridging_Algorithmic_Information_Theory_and_Machine_Learning_Part_V_Learning_Theory_in_Solomonoff_Gaussian_Hilbert_Spaces
- Hamzi, Dingle, Hutter, Vaidya. Koopman Representations from the Viewpoint of Algorithmic Information Theory. Preprint, 2026.
- Lee, Hamzi, Kevrekidis, Owhadi. Learning Local Normal Forms with Reproducing-Kernel Hilbert Space Charts: From Stuart–Landau to Moore–Greitzer Rotating Stall and Surge. Preprint, 2026
- Lee, Hamzi, Kevrekidis, Owhadi. Gaussian Processes simplify differential equations. Physica D, 2025, https://www.sciencedirect.com/science/article/abs/pii/S0167278925001484
- Yang, Sun, Hamzi, Owhadi, Xie. Learning Dynamical Systems from Data: A Simple Cross-Validation Perspective, Part V: Sparse Kernel Flows for 132 Chaotic Dynamical Systems. Physica D, 2024, https://www.sciencedirect.com/science/article/abs/pii/S0167278924000216