Discrete flow matching with arbitrary probability paths is made tractable via kinetic-optimal velocities, mixture schedulers, and a new ELBO, improving text, crystal, and image generation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Flow Matching with General Discrete Paths: A Kinetic-Optimal Perspective
Discrete flow matching with arbitrary probability paths is made tractable via kinetic-optimal velocities, mixture schedulers, and a new ELBO, improving text, crystal, and image generation.