Pith. sign in

REVIEW 2 cited by

Universal Approximation Property of Neural Ordinary Differential Equations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.02414 v1 pith:DDOSRV3O submitted 2020-12-04 cs.LG math.DGstat.ML

classification cs.LGmath.DGstat.ML
keywords nodesapproximationneuralapproximatordifferentialequationsguaranteeinput
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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 $L^p$-universal approximator for continuous maps under certain conditions. However, the $L^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$-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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Universal Approximation Theorems for Dynamical Systems with Infinite-Time Horizon Guarantees

    math.DS 2026-02 conditional novelty 7.0 of 10

    Neural ODEs can approximate Morse-Smale and continuous-attractor dynamical systems over infinite time in an ε-δ sense, provided limit-cycle periods are matched exactly.

  2. Distribution learning via neural differential equations: minimal energy regularization and approximation theory

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Explicit approximation rates for distribution learning with neural ODEs, derived from the smoothness of source and target densities.

Pith tools