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.
arXiv:2606. 23472v2 Announce Type: replace-cross Abstract: Time series classification involves learning a mapping from a continuous, temporally ordered sequence of real-valued observations to discrete response variables, like class labels.
arXiv:2607. 17990v1 Announce Type: new Abstract: Highly nonlinear chaotic dynamical systems remain difficult to model due to fundamental trade-offs between complexity, expressivity, and data efficiency.
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.
arXiv:2608. 11831v1 Announce Type: new Abstract: Learning mappings between infinite-dimensional objects is a central challenge in scientific machine learning.
arXiv:2607. 00257v1 Announce Type: new Abstract: Accurate prediction of complex dynamical systems from noisy measurements remains a significant challenge in scientific computing.
arXiv:2609.39190v1 Announce Type: new Abstract: A deep classifier is defined not only by the decision it produces, but also by the sequence of transformations through which that decision is formed. T...
A deep classifier is defined not only by the decision it produces, but also by the sequence of transformations through which that decision is formed. Treating this evolution as a dynamical system acro...
arXiv:2412. 12036v2 Announce Type: replace Abstract: System identification, the process of deriving mathematical models of dynamical systems from observed input-output data, has undergone a paradigm shift with the advent of learning-based methods.
arXiv:2607. 28080v1 Announce Type: cross Abstract: We extend a recently introduced Entropy-Optimal Manifold Clustering (EOMC) to allow for a joint simultaneous identification of subsets and subspaces of relevant features in nonstationary and nonlinear regression problems.
arXiv:2604. 24662v2 Announce Type: replace-cross Abstract: Identifying the dynamical state variables of a system from high-dimensional observations is a central problem across physical sciences.
arXiv:2605. 29669v2 Announce Type: replace-cross Abstract: Recent work in random matrix theory (RMT) has developed the notion of deterministic equivalents: typically linear surrogate models that approximate the spectral behavior of large nonlinear random matrices, such as nonlinear feature maps in neural networks (NNs).
The paper introduces the Sparse Landmark Embedding (SLE) kernel, a new framework that removes the need for conditionally negative definite (CND) distance measures in kernel methods and Gaussian Processes. By embedding each input into a sparse feature vector using compactly supported bump functions centered at all training points, any standard positive semi-definite (PSD) kernel can be applied in this embedding space, guaranteeing PSD for arbitrary distance measures. The authors provide theoretical guarantees on PSD, sparsity, stability, and universal approximation, and show through experiments with geodesic and Wasserstein distances that the SLE kernel matches or surpasses domain-specific baselines in predictive accuracy and uncertainty quantification.