nlin.CDMar 6, 2026

Chaotic Oscillator Networks for Classification Tasks

Authors: Toni Ivas, Georgios Violakis, Roland Richter, Patrik Hoffmann, Sergey Shevchik

Organizations: Intelligent Manufacturing Group (IMG) Empa, Thun, Switzerland · Hellenic Mediterranean University Heraklion, Greece

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.

Figures & tables

Explore similar work

May 20, 2026

Winfree Oscillatory Neural Network

Oscillations and synchronization are widely believed to play a fundamental role in representation and computation. However, existing machine learning approaches based on synchronization dynamics have largely been confined to specialized settings such as object discovery, with limited evidence of scalability to standard vision benchmarks or logic reasoning tasks. We propose the Winfree Oscillatory Neural Network (WONN), a dynamical neural architecture based on generalized Winfree dynamics. WONN evolves representations on the torus (S1)d(S^1)^d through structured oscillatory interactions, combining phase-based inductive biases with flexible and hierarchical interaction mechanisms instantiated as either fixed trigonometric mappings or learnable neural networks. We evaluate WONN on image recognition and complex reasoning tasks, including CIFAR, ImageNet, Maze-hard, and Sudoku. Across these domains, WONN achieves competitive or superior performance with strong parameter efficiency. In particular, WONN is, to our knowledge, the first synchronization-based oscillatory architecture to scale competitively to ImageNet-1K. Furthermore, on Maze-hard, WONN achieves 80.1% accuracy using only 1% of the parameters of prior state-of-the-art models. These results suggest that structured oscillatory dynamics provide a scalable and parameter-efficient alternative to conventional neural architectures.
Mar 10, 2026

Upper Generalization Bounds for Neural Oscillators

Neural oscillators that originate from second-order ordinary differential equations (ODEs) have shown competitive performance in learning mappings between dynamic loads and responses of complex nonlinear structural systems. Despite this empirical success, theoretically quantifying the generalization capacities of their neural network architectures remains undeveloped. In this study, the neural oscillator consisting of a second-order ODE followed by a multilayer perceptron (MLP) is considered. Its upper probably approximately correct (PAC) generalization bound for approximating causal and uniformly continuous operators between continuous temporal function spaces and that for approximating the uniformly asymptotically incrementally stable second-order dynamical systems are derived by leveraging the Rademacher complexity framework. These bounds are further extended to the squared Wasserstein-1 distances between the probability measures of quantities of interest calculated from target causal operators and the corresponding learned neural oscillators. The theoretical results show that the estimation errors grow polynomially with respect to both MLP sizes and the time length, thereby avoiding the curse of parametric complexity. Furthermore, the derived error bounds demonstrate that constraining the Lipschitz constants of the MLPs via loss function regularization can improve the generalization ability of the neural oscillator. Numerical studies considering a Bouc-Wen nonlinear system under stochastic seismic excitation validates the theoretically predicted power laws of the estimation errors with respect to the sample size and time length, and confirms the effectiveness of constraining MLPs' matrix and vector norms in enhancing the performance of the neural oscillator under limited training data.
Jun 22, 2026

The Fractal Neural Operator: Overcoming Spectral Bias in Chaotic Attractors via Prime-Harmonic Weierstrass Encodings

Deep learning models, particularly Transformers and Neural Operators, exhibit a well-documented "spectral bias," effectively acting as low-pass filters that smooth out high-frequency information. While benign in fluid dynamics, this bias is catastrophic for Chaotic Dynamical Systems, where the underlying strange attractor is characterized by fractal geometry and infinite spectral density. We introduce the Fractal Neural Operator (FNO), a novel architecture that utilizes a non-resonant prime number basis to approximate continuous dynamical systems. Unlike geometric encodings (2k2^k), which suffer from spectral gaps and resonance, our Harmonic Weierstrass Encoder injects infinite spectral resolution into the latent space. We demonstrate that FNO extends the valid prediction horizon of the Lorenz-63 system to 347 Lyapunov times, exceeding state-of-the-art Reservoir Computing baselines by a factor of 2.3x. These results suggest that "chaos" is not inherently unpredictable to neural networks, but rather requires non-differentiable, fractal embedding manifolds.