HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems

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 <inline-formula><tex-math notation="LaTeX">\math...

Full description

Bibliographic Details

Published in:	IEEE transactions on pattern analysis and machine intelligence Vol. 47; no. 8; pp. 6703 - 6714
Main Authors:	Zhang, Guojun, Gu, Zhexuan, Yuan, Yancheng, Sun, Defeng
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.08.2025
Subjects:	acceleration Approximation algorithms computational complexity Computational efficiency Computational modeling Costs Halpern iteration Histograms Kantorovich-Wasserstein distance Linear programming Memory management Numerical models Optimal transport Time complexity Training
ISSN:	0162-8828, 1939-3539, 2160-9292, 1939-3539
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!