Pith. sign in

REVIEW 1 cited by

Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.06560 v1 pith:IQOWKSWY submitted 2024-03-11 cs.LG stat.ML

classification cs.LGstat.ML
keywords manifoldsspacesdistancedistancessliced-wassersteinwassersteincartan-hadamardderive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While many Machine Learning methods were developed or transposed on Riemannian manifolds to tackle data with known non Euclidean geometry, Optimal Transport (OT) methods on such spaces have not received much attention. The main OT tool on these spaces is the Wasserstein distance which suffers from a heavy computational burden. On Euclidean spaces, a popular alternative is the Sliced-Wasserstein distance, which leverages a closed-form solution of the Wasserstein distance in one dimension, but which is not readily available on manifolds. In this work, we derive general constructions of Sliced-Wasserstein distances on Cartan-Hadamard manifolds, Riemannian manifolds with non-positive curvature, which include among others Hyperbolic spaces or the space of Symmetric Positive Definite matrices. Then, we propose different applications. Additionally, we derive non-parametric schemes to minimize these new distances by approximating their Wasserstein gradient flows.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lightspeed Geometric Dataset Distance via Sliced Optimal Transport

    cs.LG 2025-01 conditional novelty 7.0 of 10

    s-OTDD is a near-linear-time dataset distance that projects labels via scaled moments of their feature distributions and matches OTDD's correlations at a fraction of the cost.

Pith tools