arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.23015stat.MLcs.LG
收藏

耦合流匹配

Coupled Flow Matching

University of Michigan(密歇根大学);Northwestern University(西北大学)

Wenxi Cai, Yuheng Wang, Naichen Shi

AI总结:

CPFM 通过耦合流匹配整合可控降维与高保真重建,保留残差信息,实现语义丰富的嵌入和更优的重建性能。

摘要:

我们提出了耦合流匹配(CPFM),这是一个整合了可控降维与高保真重建的框架。CPFM 学习高维数据 x 和低维嵌入 y 的耦合连续流,从而能够通过潜在空间流采样 p(y|x),并通过数据空间流采样 p(x|y)。与经典降维方法(其中压缩过程中丢弃的信息往往难以恢复)不同,CPFM 将残差信息的知识保留在流网络的权重中。这种设计提供了定制化的可控性:用户可以选择在潜在空间中显式保留哪些语义因素,而互补信息则可以通过流网络恢复。耦合流匹配建立在两个组件之上:(i)扩展的 Gromov-Wasserstein 最优传输目标,用于建立数据与嵌入之间的概率对应关系;(ii)双条件流匹配网络,将该对应关系外推到潜在空间。在多个基准上的实验表明,CPFM 生成的嵌入具有丰富的语义,并且重建数据的保真度高于现有基线方法。

英文摘要:

We introduce Coupled Flow Matching (CPFM), a framework that integrates controllable dimensionality reduction and high-fidelity reconstruction. CPFM learns coupled continuous flows for both the high-dimensional data x and the low-dimensional embedding y, which enables sampling p(y|x) via a latent-space flow and p(x|y) via a data-space flow. Unlike classical dimension-reduction methods, where information discarded during compression is often difficult to recover, CPFM preserves the knowledge of residual information within the weights of a flow network. This design provides bespoke controllability: users may decide which semantic factors to retain explicitly in the latent space, while the complementary information remains recoverable through the flow network. Coupled flow matching builds on two components: (i) an extended Gromov-Wasserstein optimal transport objective that establishes a probabilistic correspondence between data and embeddings, and (ii) a dual-conditional flow-matching network that extrapolates the correspondence to the underlying space. Experiments on multiple benchmarks show that CPFM yields semantically rich embeddings and reconstructs data with higher fidelity than existing baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑