用切片势能加速多对分布间的最优传输计算,提升效率与泛化性。
Amortized Optimal Transport from Sliced Potentials

- 基于切片最优传输的势能构建预测模型,实现快速推断
- 在多个任务中达到高精度,且不依赖数据点数量
- 适合需频繁求解最优传输的生成模型与流方法
我们提出一种新型摊销优化方法,通过利用切片最优传输(sliced OT)导出的Kantorovich势能,高效预测多对测度间的最优传输(OT)方案。引入两种摊销策略:基于回归的摊销(RA-OT)和基于目标的摊销(OA-OT)。RA-OT将原始OT问题中的势能作为响应变量,切片OT势能作为预测变量,采用最小二乘法估计函数模型;OA-OT则通过优化Kantorovich对偶目标来估计模型参数。两种方法均通过估计势能恢复预测的OT方案。作为摊销型方法,二者可通过复用先前学习信息,快速近似新问题的解。同时,借助切片OT的结构特性,所提模型更简洁、不依赖具体测度结构(如离散情形下的原子数),仍保持高精度。在手写数字传输、色彩迁移、球面数据供需运输及小批量条件流匹配等任务中验证了其有效性。
原文摘要 · Abstract (English)
We propose a novel amortized optimization method for predicting optimal transport (OT) plans across multiple pairs of measures by leveraging Kantorovich potentials derived from sliced OT. We introduce two amortization strategies: regression-based amortization (RA-OT) and objective-based amortization (OA-OT). In RA-OT, we formulate a functional regression model that treats Kantorovich potentials from the original OT problem as responses and those obtained from sliced OT as predictors, and estimate these models via least-squares methods. In OA-OT, we estimate the parameters of the functional model by optimizing the Kantorovich dual objective. In both approaches, the predicted OT plan is subsequently recovered from the estimated potentials. As amortized OT methods, both RA-OT and OA-OT enable efficient solutions to repeated OT problems across different measure pairs by reusing information learned from prior instances to rapidly approximate new solutions. Moreover, by exploiting the structure provided by sliced OT, the proposed models are more parsimonious, independent of specific structures of the measures, such as the number of atoms in the discrete case, while achieving high accuracy. We demonstrate the effectiveness of our approaches on tasks including MNIST digit transport, color transfer, supply-demand transportation on spherical data, and mini-batch OT conditional flow matching.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。