English

Universal Approximation Property of Neural Ordinary Differential Equations

Machine Learning 2020-12-07 v1 Differential Geometry Machine Learning

Abstract

Neural ordinary differential equations (NODEs) is an invertible neural network architecture promising for its free-form Jacobian and the availability of a tractable Jacobian determinant estimator. Recently, the representation power of NODEs has been partly uncovered: they form an LpL^p-universal approximator for continuous maps under certain conditions. However, the LpL^p-universality may fail to guarantee an approximation for the entire input domain as it may still hold even if the approximator largely differs from the target function on a small region of the input space. To further uncover the potential of NODEs, we show their stronger approximation property, namely the sup\sup-universality for approximating a large class of diffeomorphisms. It is shown by leveraging a structure theorem of the diffeomorphism group, and the result complements the existing literature by establishing a fairly large set of mappings that NODEs can approximate with a stronger guarantee.

Keywords

Cite

@article{arxiv.2012.02414,
  title  = {Universal Approximation Property of Neural Ordinary Differential Equations},
  author = {Takeshi Teshima and Koichi Tojo and Masahiro Ikeda and Isao Ishikawa and Kenta Oono},
  journal= {arXiv preprint arXiv:2012.02414},
  year   = {2020}
}

Comments

10 pages, 1 table. Accepted at NeurIPS 2020 Workshop on Differential Geometry meets Deep Learning

R2 v1 2026-06-23T20:43:33.233Z