Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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 d,q,B≥1, N≥0, and Θ⊆Rq be open. Let λ be a sigma-finite Borel measure on Rd, let π be a Borel probability measure on Rd, and let ρ:[0,1]×Rd×Rd→[0,∞] and uc:[0,1]×Rd×Rd→Rd be jointly measurable. Assume ∫ρt(x∣x1) λ(dx)=1 for every t and for π-almost every x1, and that for π-almost every x1, ρt(⋅∣x1) and every component of ρtutc(⋅∣x1) are continuously differentiable in (t,x) on (0,1)×Rd and satisfy ∂tρt(x∣x1)+∑j=1d∂xj(ρt(x∣x1)(utc)j(x∣x1))=0. For every compact K⊂(0,1)×Rd, suppose there is a nonnegative GK∈L1(π) bounding on K, for π-almost every x1, the absolute values of ρt, ∂tρt, each component of ρtutc, and each corresponding spatial flux derivative.

Define pt(x):=∫ρt(x∣x1) π(dx1) and Jt(x):=∫ρt(x∣x1)utc(x∣x1) π(dx1). Assume 0<pt(x)<∞ and Jt(x) is finite on [0,1]×Rd, and put utm(x):=Jt(x)/pt(x). Let v:[0,1]×Rd×Θ→Rd be jointly measurable and continuously differentiable in θ, with jointly measurable parameter derivative. Define LC(θ):=∫01 ⁣∫ ⁣∫ρt(x∣x1)∥v(t,x;θ)−utc(x∣x1)∥22 π(dx1)λ(dx)dt and LM(θ):=∫01 ⁣∫pt(x)∥v(t,x;θ)−utm(x)∥22 λ(dx)dt. Assume, almost surely, that LC(θk) and LM(θk) are finite for every k=0,…,N, and that C:=∫01 ⁣∫ ⁣∫ρt(x∣x1)∥utc(x∣x1)−utm(x)∥22 π(dx1)λ(dx)dt is finite. Write Dθv for the matrix with entries (Dθv)ij=∂θjvi. For every compact H⊂Θ and coordinate j, suppose nonnegative integrable majorants GH,jC on dt λ(dx) π(dx1) and GH,jM on dt λ(dx) satisfy, for every θ∈H outside fixed null sets, 2ρt(x∣x1)∣⟨∂θjv(t,x;θ),v(t,x;θ)−utc(x∣x1)⟩∣≤GH,jC(t,x,x1) and 2pt(x)∣⟨∂θjv(t,x;θ),v(t,x;θ)−utm(x)⟩∣≤GH,jM(t,x). Let Q(dt,dx1,dx):=dt π(dx1)ρt(x∣x1)λ(dx) be the probability law of a training triple, with dt Lebesgue probability measure on [0,1]. Take θ0 as fixed and let F0 be the trivial history. At iteration k, let Fk be the history before the batch, so θk is Fk-measurable; draw B independent triples with law Q, independently of Fk, and set Fk+1 to be the sigma-algebra generated by Fk and that batch. For a triple w=(t,x1,x), define ζ(θ,w):=2 Dθv(t,x;θ)T(v(t,x;θ)−utc(x∣x1)). For each k,b, set ζk,b:=ζ(θk,(Tk,b,X1,k,b,Xk,b)) and require it to be integrable on the joint training probability space.

Given the fixed initial parameter θ0∈Θ and deterministic step sizes η0,…,ηN−1≥0, for each k=0,…,N−1 set gk:=1B∑b=1Bζk,b,θk+1:=θk−ηkgk. Assume all iterates θ0,…,θN 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 FN, draw X0 from a supplied initial probability law μ0 independently of FN, and return X1=Φ1,0θN(X0), where Φt,sθN solves z˙(t)=v(t,z(t);θN) with z(s)=X0. This last step is well-defined if the field extends to an open time interval containing [0,1], is jointly C∞ in time, state, and parameter, and on every compact parameter set H⊂Θ has uniform constants LH,MH≥0 satisfying ∥v(t,z;θ)−v(t,w;θ)∥2≤LH∥z−w∥2,∥v(t,0;θ)∥2≤MH for t∈[0,1], θ∈H, and z,w∈Rd. Conditional on FN, the output law assigns mass μ0({x:Φ1,0θN(x)∈A}) to each Borel set A⊆Rd. The procedure gives no convergence guarantee for the parameter updates or equality of this output law with a desired data law.

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

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