Search Results for author:
Found 4 papers, 1 papers with code
On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance Gaps
This paper presents consideration of the Semi-Relaxed Sinkhorn (SR-Sinkhorn) algorithm for the semi-relaxed optimal transport (SROT) problem, which relaxes one marginal constraint of the standard OT problem.
Block-coordinate Frank-Wolfe algorithm and convergence analysis for semi-relaxed optimal transport problem
As a superior alternative, we propose a fast block-coordinate Frank-Wolfe (BCFW) algorithm for a convex semi-relaxed OT.
Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal transport
To this end, addressing a convex semi-relaxed OT, we propose a fast block-coordinate Frank-Wolfe (BCFW) algorithm, which gives sparse solutions.
Wasserstein k-means with sparse simplex projection
This paper presents a proposal of a faster Wasserstein $k$-means algorithm for histogram data by reducing Wasserstein distance computations and exploiting sparse simplex projection.
