We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Optimal transport (OT) is a popular measure to compare probability distributions. However, OT suffers a few drawbacks such as (i) a high complexity for computation, (ii) indefiniteness which limits its applicability to kernel machines. In this work, we consider probability measures supported on a graph metric space and propose a novel Sobolev transport metric. We show that the Sobolev transport metric yields a closed-form formula for fast computation and it is negative definite. We show that the space of probability measures endowed with this transport distance is isometric to a bounded convex set in a Euclidean space with a weighted $\ell_p$ distance. We further exploit the negative definiteness of the Sobolev transport to design positive-definite kernels, and evaluate their performances against other baselines in document classification with word embeddings and in topological data analysis.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2202.10723")
get_code_for_paper("2202.10723")
have("2202.10723")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2202.10723.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2202.10723)
Connect an agent — have() is free.