Conditional Flow Matching for Transport Between Markov Processes
A flow matching based algorithm is formulated which learns a transport map from the source to target trajectory distribution, while preserving the Markov structure, which is consistent in the population limit and derive finite-sample error bounds under mixing time assumptions.
Syamantak Kumar, D. Nagaraj, Saptarshi Roy et al.
· 0 citations