arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.16645math.OCstat.ML
收藏

一类特殊最优输运问题的改进匈牙利算法

Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithm

Yiling Xie, Yiling Luo, Xiaoming Huo

摘要:

在基于Wasserstein距离的独立性检验中,计算经验Wasserstein距离是一个具有特殊结构的最优输运(OT)问题。这一观察启发我们研究一种特殊类型的OT问题,并提出一种改进的匈牙利算法来精确求解它。对于包含两个分别含有$m$和$n$原子的边元($m\geq n$)的OT问题,算法的计算复杂性为$O(m^2n)$ .在独立性测试中计算经验Wasserstein距离需要解决这种特殊类型的OT问题,其中$m=n^2$。所提出的算法的相关计算复杂性是$O(n^5)$,而应用经典匈牙利算法的顺序是$O(n^6)$。除了上述特殊类型的OT问题,它表明,修改后的匈牙利算法可以采用解决更广泛的OT问题。该算法的更广泛的应用进行了讨论-解决一对多分配问题和多对多分配问题。我们进行数值实验来验证我们的理论结果。实验结果表明,改进的匈牙利算法优于匈牙利算法,著名的Sinkhorn算法,网络单纯形算法。

英文摘要:

Computing the empirical Wasserstein distance in the Wasserstein-distance-based independence test is an optimal transport (OT) problem with a special structure. This observation inspires us to study a special type of OT problem and propose a modified Hungarian algorithm to solve it exactly. For the OT problem involving two marginals with $m$ and $n$ atoms ($m\geq n$), respectively, the computational complexity of the proposed algorithm is $O(m^2n)$. Computing the empirical Wasserstein distance in the independence test requires solving this special type of OT problem, where $m=n^2$. The associated computational complexity of the proposed algorithm is $O(n^5)$, while the order of applying the classic Hungarian algorithm is $O(n^6)$. In addition to the aforementioned special type of OT problem, it is shown that the modified Hungarian algorithm could be adopted to solve a wider range of OT problems. Broader applications of the proposed algorithm are discussed -- solving the one-to-many assignment problem and the many-to-many assignment problem. We conduct numerical experiments to validate our theoretical results. The experiment results demonstrate that the proposed modified Hungarian algorithm compares favorably with the Hungarian algorithm, the well-known Sinkhorn algorithm, and the network simplex algorithm.

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

↑