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.
Conditional flow-matching training and exact-flow sampling
Definition
Let , , and be open. Let be a sigma-finite Borel measure on , let be a Borel probability measure on , and let and be jointly measurable. Assume for every and for -almost every , and that for -almost every , and every component of are continuously differentiable in on and satisfy For every compact , suppose there is a nonnegative bounding on , for -almost every , the absolute values of , , each component of , and each corresponding spatial flux derivative.
Define and . Assume and is finite on , and put . Let be jointly measurable and continuously differentiable in , with jointly measurable parameter derivative. Define and Assume, almost surely, that and are finite for every , and that is finite. Write for the matrix with entries . For every compact and coordinate , suppose nonnegative integrable majorants on and on satisfy, for every outside fixed null sets, and Let be the probability law of a training triple, with Lebesgue probability measure on . Take as fixed and let be the trivial history. At iteration , let be the history before the batch, so is -measurable; draw independent triples with law , independently of , and set to be the sigma-algebra generated by and that batch. For a triple , define For each , set and require it to be integrable on the joint training probability space.
Given the fixed initial parameter and deterministic step sizes , for each set Assume all iterates remain in almost surely. Training uses only conditional samples and does not solve the parameterized ODE during these updates. After training, condition on the history , draw from a supplied initial probability law independently of , and return , where solves with . This last step is well-defined if the field extends to an open time interval containing , is jointly in time, state, and parameter, and on every compact parameter set has uniform constants satisfying for , , and . Conditional on , the output law assigns mass to each Borel set . The procedure gives no convergence guarantee for the parameter updates or equality of this output law with a desired data law.
Definition references
Source notes
The cited papers specify the conditional sample, squared regression loss, parameter update, and ODE sampling steps. This algorithm makes the sampler law, batch gradient, exact global-flow conditions, and output law explicit. Its parameter updates carry no optimization convergence guarantee, and the exact flow is a mathematical solution rather than a numerical solver with an error bound.
Depends on
- Probability paths and velocity fields
- Conditional and marginal flow-matching objectives differ by a constant
- A parameterized neural ordinary differential equation
- A globally Lipschitz neural ODE has a global smooth flow
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The Lebesgue integral is linear on $L^1(\mu)$
- Law or distribution of a random element
- Conditional expectation given a sigma algebra
- Independent random elements have product joint law
- Change of variables for expectation
- Fubini's theorem for L^1 functions on a sigma-finite product
- The modulus of an integral is bounded by the integral of the modulus
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
Used by
Dependency tree · two levels
73 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Yaron Lipman et al., Flow Matching for Generative Modeling, §§3.2 and 6.2 (standard reference, not scraped)
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.3 Algorithm 3 (standard reference, not scraped)