熵最优传输区域分解的流更新方法
Flow updates for domain decomposition of entropic optimal transport
AI总结:
本文提出流更新方法解决熵最优传输区域分解在细划分下冻结的问题,证明收敛性,并通过GPU实验验证其有效性。
摘要:
区域分解已被证明是求解大规模熵最优传输问题的一种计算高效的分布式方法。然而,该算法的朴素实现在极细划分单元(即渐近地变得平稳且无法找到全局最小值)的极限下可能会冻结,因为信息只能在单元之间缓慢传播。在实践中,可以通过由粗到细的多尺度方案来避免这种情况。在本文中,我们引入流更新作为一种替代方法。流更新可以被解释为Angenent、Haker和Tannenbaum著名算法的一种变体,并且可以自然地与区域分解相结合。我们证明了其收敛到全局最小值,并对其连续极限进行了形式化讨论。我们与朴素和多尺度区域分解进行了数值比较,并表明流更新在单元数量非常多的情形下防止了冻结。虽然观察到多尺度方案通常比混合方法更快,但在存在良好初始耦合的情况下,后者可能是一种可行的替代方案。我们的数值实验基于我们在附录中描述的一种新颖的GPU区域分解实现。
英文摘要:
Domain decomposition has been shown to be a computationally efficient distributed method for solving large scale entropic optimal transport problems. However, a naive implementation of the algorithm can freeze in the limit of very fine partition cells (i.e. it asymptotically becomes stationary and does not find the global minimizer), since information can only travel slowly between cells. In practice this can be avoided by a coarse-to-fine multiscale scheme. In this article we introduce flow updates as an alternative approach. Flow updates can be interpreted as a variant of the celebrated algorithm by Angenent, Haker, and Tannenbaum, and can be combined canonically with domain decomposition. We prove convergence to the global minimizer and provide a formal discussion of its continuity limit. We give a numerical comparison with naive and multiscale domain decomposition, and show that the flow updates prevent freezing in the regime of very many cells. While the multiscale scheme is observed to be faster than the hybrid approach in general, the latter could be a viable alternative in cases where a good initial coupling is available. Our numerical experiments are based on a novel GPU implementation of domain decomposition that we describe in the appendix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。