提出通用离散路径生成模型,可自由设计数据污染过程。
Flow Matching with General Discrete Paths: A Kinetic-Optimal Perspective
- 基于连续时间马尔可夫链,允许任意概率路径构造
- 混合路径在对称动能上最优,性能超越掩码方法
- 适用于文本、材料、图像生成,适合领域知识融入
离散空间生成模型的设计空间远不如连续空间清晰,多数工作仅关注简单的掩码构造。本文从连续时间马尔可夫链出发,首次允许使用任意离散概率路径(即污染过程),通过优化对称动能,提出可适配任意路径的速度公式,实现概率与速度完全解耦。用户可依据特定数据领域的专家知识自由指定概率路径。我们发现一种混合路径构造能最优地最小化离散情况下的对称动能。在文本生成、无机材料生成和图像生成多个模态上验证了新设计空间的有效性:在文本中,基于动能最优的混合路径已超越掩码构造;在视觉领域,可利用领域特异性路径构造,提升生成质量。
原文摘要 · Abstract (English)
The design space of discrete-space diffusion or flow generative models are significantly less well-understood than their continuous-space counterparts, with many works focusing only on a simple masked construction. In this work, we aim to take a holistic approach to the construction of discrete generative models based on continuous-time Markov chains, and for the first time, allow the use of arbitrary discrete probability paths, or colloquially, corruption processes. Through the lens of optimizing the symmetric kinetic energy, we propose velocity formulas that can be applied to any given probability path, completely decoupling the probability and velocity, and giving the user the freedom to specify any desirable probability path based on expert knowledge specific to the data domain. Furthermore, we find that a special construction of mixture probability paths optimizes the symmetric kinetic energy for the discrete case. We empirically validate the usefulness of this new design space across multiple modalities: text generation, inorganic material generation, and image generation. We find that we can outperform the mask construction even in text with kinetic-optimal mixture paths, while we can make use of domain-specific constructions of the probability path over the visual domain.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。