Search Results for author:
Found 2 papers, 1 papers with code
The Graph Cut Kernel for Ranked Data
Many algorithms for ranked data become computationally intractable as the number of objects grows due to the complex geometric structure induced by rankings.
Sliced Multi-Marginal Optimal Transport
To construct this distance, we introduce a characterization of the one-dimensional multi-marginal Kantorovich problem and use it to highlight a number of properties of the sliced multi-marginal Wasserstein distance.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
