Neural ODE control for classification, approximation and transport
Dom\`enec Ruiz-Balet, Enrique Zuazua

TL;DR
This paper applies control theory to Neural ODEs to analyze their capabilities in classification and approximation, providing constructive proofs and linking neural transport to optimal transport.
Contribution
It introduces a control-theoretic framework for Neural ODEs, offering nonlinear, constructive proofs for classification and approximation, applicable to ReLU activations.
Findings
Control strategies can classify data by controlling NODEs from initial to label-specific subdomains.
The nonlinear properties of NODEs enable finite-step transformations using hyperplanes.
Results connect neural transport equations with optimal transport theory.
Abstract
We analyze Neural Ordinary Differential Equations (NODEs) from a control theoretical perspective to address some of the main properties and paradigms of Deep Learning (DL), in particular, data classification and universal approximation. These objectives are tackled and achieved from the perspective of the simultaneous control of systems of NODEs. For instance, in the context of classification, each item to be classified corresponds to a different initial datum for the control problem of the NODE, to be classified, all of them by the same common control, to the location (a subdomain of the euclidean space) associated to each label. Our proofs are genuinely nonlinear and constructive, allowing us to estimate the complexity of the control strategies we develop. The nonlinear nature of the activation functions governing the dynamics of NODEs under consideration plays a key role in our…
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.
Taxonomy
TopicsModel Reduction and Neural Networks
