2 papers
math.NA2026
FINOM: Fast Sinkhorn on Non-uniform Meshes
Qihao Cheng, Qichen Liao, Hao Wu +1
A linear-complexity algorithm for computing the Wasserstein-1 distance on non-uniform meshes is proposed. This work extends the fast Sinkhorn algorithms from [Q. Liao et al., Commu…
math.OC2025
A Linear Complexity Algorithm for Optimal Transport Problem with Log-type Cost
Ziyuan Lyu, Zihao Wang, Hao Wu +1
In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complex…