Upper Approximation Bounds for Neural Oscillators
Zifeng Huang, Konstantin M. Zuev, Yong Xia, and Michael Beer

TL;DR
This paper establishes theoretical upper bounds on the approximation capabilities of neural oscillators, demonstrating their efficiency in modeling complex dynamical systems with polynomial error scaling.
Contribution
It derives novel approximation bounds for neural oscillators, extending the theory to state-space models and validating results with numerical experiments.
Findings
Approximation error scales polynomially with MLP widths.
Bounds apply to causal, continuous operators and stable second-order systems.
Numerical experiments confirm theoretical convergence rates.
Abstract
Neural oscillators, originating from second-order ordinary differential equations (ODEs), have demonstrated strong performance in stably learning causal mappings between long-term sequences or continuous temporal functions, as well as in accurately approximating physical systems. However, theoretically quantifying the capacities of their neural network architectures remains a significant challenge. In this study, the neural oscillator consisting of a second-order ODE followed by a multilayer perceptron (MLP) is considered. Its upper approximation bound for approximating causal and uniformly continuous operators between continuous temporal function spaces and that for approximating uniformly asymptotically incrementally stable second-order dynamical systems are derived. The established proof method of the approximation bound for approximating the causal continuous operators can also be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
