SearcharxivSearch

arXiv · 2603.16909

Chaotic Oscillator Networks for Classification Tasks

Abstract

Chaotic oscillators have gained significant attention in the research community because of their ability to reproduce and investigate the complex dynamics of real-world phenomena. Recent advances in the design of chaotic oscillator ensembles have led to the development of efficient signal processing frameworks that surpass traditional approaches. However, scaling such systems remains challenging due to the significant increase of computational resources and issues with training convergence. This study advances the state of the art by addressing the problem of data processing with ensembles of nonlinear oscillators that can be scaled up. In our approach, the processing is achieved as an anticipated local resonance or echo in a group of coupled chaotic oscillators, driven by external data input. Local resonance is enabled by tuning the coupling terms between the oscillators, which are approximated using the traditional artificial neural network and adapted to match the input feature distributions. Training the framework entails training this neural network to capture the dynamics of the entire oscillator system. The framework is evaluated using synthetic data and demonstrates an accuracy in machine learning classification task, while patterns recognition and dynamic system identification are also presented here as an extension of the functionality that involves additional modifications. Additionally, the universality of this approach is demonstrated by tests with different connections configurations between the oscillators and their types. The main advantage of the proposed framework is that it avoids hand-crafting explicit coupling terms, which requires expert knowledge and does not scale for large problems. Leveraging standard machine learning components simplifies both training and deployment of oscillator networks, enabling gradient-based optimization.

Explore related subjects

Keep this discovery

BibTeXRIS

Toni Ivas, Georgios Violakis, Roland Richter, Patrik Hoffmann, Sergey Shevchik. 2026-03-06. Chaotic Oscillator Networks for Classification Tasks. https://arxiv.org/abs/2603.16909

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD