A non-autonomous equation discovery method for time signal classification

Abstract

Certain neural network architectures, in the infinite-layer limit, lead to systems of nonlinear differential equations. Motivated by this idea, we develop a framework for analyzing time signals based on non-autonomous dynamical equations. We view the time signal as a forcing function for a dynamical system that governs a time-evolving hidden variable. As in equation discovery, the dynamical system is represented using a dictionary of functions and the coefficients are learned from data. This framework is applied to the time signal classification problem. We show how gradients can be efficiently computed using the adjoint method, and we apply methods from dynamical systems to establish stability of the classifier. Through a variety of experiments, on both synthetic and real datasets, we show that the proposed method uses orders of magnitude fewer parameters than competing methods, while achieving comparable accuracy. We created the synthetic datasets using dynamical systems of increasing complexity; though the ground truth vector fields are often polynomials, we find consistently that a Fourier dictionary yields the best results. We also demonstrate how the proposed method yields graphical interpretability in the form of phase portraits.

25 pages, 2 figures

References in corpus (8)

• On the difficulty of training Recurrent Neural Networks
• Deep learning for time series classification: a review
• GRU-ODE-Bayes: Continuous modeling of sporadically-observed time series
• Neural Controlled Differential Equations for Irregular Time Series
• AntisymmetricRNN: A Dynamical System View on Recurrent Neural Networks
• A recurrent neural network without chaos
• SNODE: Spectral Discretization of Neural ODEs for System Identification
• STEER: Simple Temporal Regularization For Neural ODEs