How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A parameterized neural ordinary differential equation
Definition
Let , let and be open, and let . For a parameter , write . The parameterized ordinary differential equation on is the initial-value problem
where and . A trajectory on an interval containing is a differentiable function satisfying both displayed conditions. Here is the state-velocity field.
It is a parameterized neural ordinary differential equation, or neural ODE, when is specified by a neural network with input and outputs. Here a network is a fixed finite directed acyclic graph evaluated in an order in which every edge points to a later vertex: input vertices hold the coordinates of , each other vertex applies a fixed scalar activation to an affine combination of earlier vertex values, and the output vertices use the identity activation. The weights and biases are specified functions of and may be shared or fixed. No particular depth, width, or hidden activation is prescribed; affine networks with no hidden vertices are allowed.
The general parameterized ODE remains defined for fields without such a network specification. This definition alone asserts neither solution existence beyond its stated interval nor numerical accuracy.
Definition references
Used by
- Conditional flow-matching training and exact-flow sampling Algorithm
- Exact continuous adjoint sensitivity for a neural ODE Algorithm
- A finite Euler adjoint gradient can differ from the exact flow gradient Example
- Conditional flow-matching batch gradients and exact-flow output law Lemma
- A globally Lipschitz neural ODE has a global smooth flow Theorem
- Instantaneous change of variables along a neural ODE flow Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Ricky T. Q. Chen, Yulia Rubanova, Jesse Bettencourt, and David Duvenaud, Neural Ordinary Differential Equations (standard reference, not scraped)
- George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan, Normalizing Flows for Probabilistic Modeling and Inference (standard reference, not scraped)