首个离散扩散模型评估基准,可精准测试生成模型性能。
Entering the Era of Discrete Diffusion Models: A Benchmark for Schrödinger Bridges and Entropic Optimal Transport
- 构建带解析解的离散概率分布对,实现精确评估
- 提出新算法DLightSB与DLightSB-M,提升求解精度
- 适合研究生成模型与最优传输的学者使用
熵正则最优运输(EOT)及其动态形式——薛定谔桥(SB)问题,在现代机器学习中具有重要地位,连接生成建模与最优传输理论。尽管离散扩散与流模型的进展推动了将SB方法应用于离散领域,但目前尚无可靠手段评估其求解效果。本文提出首个离散空间上的薛定谔桥基准,构造出具有解析已知解的概率分布对,实现严格评估。构建过程中,我们提出两种新算法:DLightSB与DLightSB-M,并扩展已有工作得到α-CSBM算法。通过在高维离散设置下评估现有及新提出的求解器,验证了该基准的实用性。本工作为离散空间上薛定谔桥方法的合理评估提供了第一步,有助于未来研究的可复现性。代码与实验均已开源:https://github.com/gregkseno/catsbench。
原文摘要 · Abstract (English)
The Entropic Optimal Transport (EOT) problem and its dynamic counterpart, the Schrödinger bridge (SB) problem, play an important role in modern machine learning, linking generative modeling with optimal transport theory. While recent advances in discrete diffusion and flow models have sparked growing interest in applying SB methods to discrete domains, there remains no reliable way to assess how well these methods actually solve the underlying problem. We address this challenge by introducing a benchmark for SB on discrete spaces. Our construction yields pairs of probability distributions with analytically known SB solutions, enabling rigorous evaluation. As a byproduct of building this benchmark, we obtain two new SB algorithms, DLightSB and DLightSB-M, and additionally extend prior related work to construct the $α$-CSBM algorithm. We demonstrate the utility of our benchmark by evaluating both existing and new solvers in high-dimensional discrete settings. This work provides the first step toward proper evaluation of SB methods on discrete spaces, paving the way for more reproducible future studies. The code for the benchmark and all associated experiments is available at https://github.com/gregkseno/catsbench.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。