通过双向流匹配实现可控制降维与高保真重建
Coupled Flow Matching
- 构建数据与嵌入空间的双向连续流,实现双向采样
- 在多个基准上生成语义丰富的嵌入并提升重建质量
- 支持用户显式控制保留的语义因子,适合需要可控生成的场景
我们提出耦合流匹配(CPFM),一种结合可控制降维与高保真重建的框架。CPFM 学习高维数据 x 与低维嵌入 y 的耦合连续流,支持通过潜空间流采样 p(y|x),并通过数据空间流采样 p(x|y)。与传统降维方法不同,CPFM 将压缩过程中丢失的信息保留在流网络权重中,实现知识留存。该设计赋予用户定制化控制能力:可显式保留特定语义因素,其余信息仍可通过流网络恢复。CPFM 基于两个组件:(i) 扩展的格罗莫夫-沃瑟斯坦最优传输目标,建立数据与嵌入间的概率对应关系;(ii) 双条件流匹配网络,将对应关系外推至底层空间。在多个基准上的实验表明,CPFM 生成的嵌入语义丰富,且数据重建精度优于现有基线。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。