REVIEW 3 cited by
Approximation Capabilities of Neural ODEs and Invertible Residual Networks
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
Signed reviews
abstract
Neural ODEs and i-ResNet are recently proposed methods for enforcing invertibility of residual neural models. Having a generic technique for constructing invertible models can open new avenues for advances in learning systems, but so far the question of whether Neural ODEs and i-ResNets can model any continuous invertible function remained unresolved. Here, we show that both of these models are limited in their approximation capabilities. We then prove that any homeomorphism on a $p$-dimensional Euclidean space can be approximated by a Neural ODE operating on a $2p$-dimensional Euclidean space, and a similar result for i-ResNets. We conclude by showing that capping a Neural ODE or an i-ResNet with a single linear layer is sufficient to turn the model into a universal approximator for non-invertible continuous functions.
Forward citations
Cited by 3 Pith papers
-
The Influence of the Memory Capacity of Neural DDEs on the Universal Approximation Property
Neural DDEs are universal approximators only when the product of Lipschitz constant and delay is large enough; small memory capacity makes them behave like non-universal neural ODEs.
-
Deep neural networks, generic universal interpolation, and controlled ODEs
Finite training sets of any size can be exactly interpolated by a controlled ODE with five fixed vector fields, and this property holds generically for random real analytic vector fields.
-
Normalizing Flows: An Introduction and Review of Current Methods
A survey that organizes normalizing flow methods into a taxonomy and reviews their mathematical foundations, reported performance, and open problems.
Discussion (0). Continue with ORCID to comment.