HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems

Guojun Zhang

doi:10.1109/TPAMI.2025.3564353

Return

HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems

2025-08-01

DOI：10.1109/TPAMI.2025.3564353

Original

Original request for help

Save

Abstract

En 中文

This paper proposes an efficient HOT algorithm for solving the optimal transport (OT) problems with finite supports. We particularly focus on an efficient implementation of the HOT algorithm for the case where the supports are in $\mathbb {R}^{2}$ with ground distances calculated by $L_{2}^{2}$-norm. Specifically, we design a Halpern accelerating algorithm to solve the equivalent reduced model of the discrete OT problem. Moreover, we derive a novel procedure to solve the involved linear systems in the HOT algorithm in linear time complexity. Consequently, we can obtain an $\varepsilon$-approximate solution to the optimal transport problem with $M$ supports in $O(M^{1.5}/\varepsilon )$ flops, which significantly improves the best-known computational complexity. We further propose an efficient procedure to recover an optimal transport plan for the original OT problem based on a solution to the reduced model, thereby overcoming the limitations of the reduced OT model in applications that require the transport plan. We implement the HOT algorithm in PyTorch and extensive numerical results show the superior performance of the HOT algorithm compared to existing state-of-the-art algorithms for solving the OT problems.

Keywords:

Optimal transport

Kantorovich-Wasserstein distance

Halpern iteration

acceleration

computational complexity