Skip to content
Preprint

A Constrained Kuramoto Gradient-Flow System Can Perform High-Accuracy Finite-Time Inference

Sep 2026 · 0 citations
Physics

TL;DR

A constructive demonstration that a strongly constrained, small-sized Kuramoto gradient-flow system can be trained for high-accuracy finite-time inference through a direct oscillator readout.

Abstract

A central question in physical inference is whether strongly constrained dynamical systems can realize accurate input--output maps through their own finite-time evolution. We study this question in Kuramoto phase networks, whose deterministic dynamics form an input-conditioned gradient flow and whose predictions are read directly from output oscillators. As a constructive training approach, we develop a two-stage teacher--student procedure. A neural teacher is first converted into an explicit phase trajectory whose terminal oscillator activations reproduce the teacher outputs, and the Kuramoto parameters are trained by matching the student vector field along this prescribed path. Because accurate teacher-forced path matching does not ensure accurate autonomous inference, we then differentiate through the autonomous finite-time rollout and directly align its terminal output with the neural target. The resulting oscillator system, with $74$ oscillators, reaches mean test accuracies of $96.711\%$ on MNIST and $86.399\%$ on Fashion-MNIST. This capability persists across neural-teacher architectures, matched system sizes, thermal perturbations, and integration-grid refinement. Together, these results provide a constructive demonstration that a strongly constrained, small-sized Kuramoto gradient-flow system can be trained for high-accuracy finite-time inference through a direct oscillator readout.

View source

Similar papers

#machine learning Preprint Aug 2026

Propensity Straight-Through Gradients for Discrete Stochastic Systems

This work exploits the affine state update to obtain the exact one-step conditional-mean sensitivity by differentiating normalized reaction propensities, and defines the propensity straight-through (PST) estimator, a temperature- and Gumbel-free path to scalable gradient-based learning through exact stochastic trajecto...

Jose M. G. Vilar, Leonor Saiz · 0 citations
Preprint Aug 2026

StocBench: A Benchmark for Generative Modeling of Stochastic Dynamics

While stochastic diffusion samplers such as DDPM better preserve the enstrophy spectrum during rollouts in the stochastic setting, deterministic samplers such as DDIM and DPM-2 show better spectral preservation in the deterministic setting.

S. Pfister, Benjamin J. Holzschuh, Nils Thuerey · 2 citations
Oct 2026

Generative Dynamical Synthesis: A Behavioral Learning Framework for Autonomous Neural Dynamical Systems from Bifurcation Diagrams

Many machine-learning approaches to nonlinear dynamical systems focus on trajectory prediction or equation discovery. This work introduces the Generative Dynamical Synthesis (GDS) framework, a behavioral learning approach in which an autonomous neural dynamical system is trained from asymptotic state-transition samples...

Christos K. Volos, Chun-Biao Li · 0 citations
Preprint Aug 2026

Finite-Horizon Input-Output Dynamics of Minibatch Perturbations in AdamW

This work forms AdamW as a finite-horizon input--state--output (ISO) system whose state contains the model parameters and first- and second-moment estimates, and derives an exact multistep error decomposition and establishes first-order finite-horizon accuracy under local smoothness and controlled activation switching.

Kangning Liu, Su-Yan Li · 1 citation
Preprint Oct 2026

Higher-Order Kolmogorov-Arnold Networks for Dynamics

The ability to derive the governing equations of a dynamical system from data is essential for prediction and control across many scientific fields. Two challenges, however, are the expansion of candidate terms when reducing higher-order equations to first-order form and noise from estimating derivatives. We propose Hi...

Kevin Slote, Jeremie Fish · 0 citations

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