Search Results for author:
Found 3 papers, 1 papers with code
Anchor Space Optimal Transport: Accelerating Batch Processing of Multiple OT Problems
Therefore, we propose a translated OT problem designated as the anchor space optimal transport (ASOT) problem, which is specially designed for batch processing of multiple OT problem solutions.
Safe Screening for Unbalanced Optimal Transport
We demonstrate the feasibility of applying Safe Screening to the UOT problem with $\ell_2$-penalty and KL-penalty by conducting an analysis of the solution's bounds and considering the local strong convexity of the dual problem.
Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees
In this paper, we propose a novel graph metric called the Wasserstein WL Subtree (WWLS) distance to address this problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
