Skip to main navigation Skip to search Skip to main content

Rademacher Complexity of Neural ODEs via Chen–Fliess Series

Research output: Contribution to journalConference articlepeer-review

Abstract

We show how continuous-depth neural ODE models can be framed as single-layer, infinite-width nets using the Chen–Fliess series expansion for nonlinear ODEs. In this net, the output “weights” are taken from the signature of the control input — a tool used to represent infinite-dimensional paths as a sequence of tensors — which comprises iterated integrals of the control input over a simplex. The “features” are taken to be iterated Lie derivatives of the output function with respect to the vector fields in the controlled ODE model. The main result of this work applies this framework to derive compact expressions for the Rademacher complexity of ODE models that map an initial condition to a scalar output at some terminal time. The result leverages the straightforward analysis afforded by single-layer architectures. We conclude with some examples instantiating the bound for some specific systems and discuss potential follow-up work.

Original languageEnglish (US)
Pages (from-to)758-769
Number of pages12
JournalProceedings of Machine Learning Research
Volume242
StatePublished - 2024
Event6th Annual Learning for Dynamics and Control Conference, L4DC 2024 - Oxford, United Kingdom
Duration: Jul 15 2024Jul 17 2024

Keywords

  • Chen–Fliess series
  • generalization bound
  • Neural ODE
  • Rademacher complexity

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Statistics and Probability

Fingerprint

Dive into the research topics of 'Rademacher Complexity of Neural ODEs via Chen–Fliess Series'. Together they form a unique fingerprint.

Cite this