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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on pattern analysis and machine intelligence Ročník 47; číslo 8; s. 6703 - 6714
Hlavní autori:	Zhang, Guojun, Gu, Zhexuan, Yuan, Yancheng, Sun, Defeng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.08.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!