Linearized Wasserstein dimensionality reduction with approximation guarantees

The paper introduces LOT Wassmap, an algorithm designed to uncover low‑dimensional structures in the Wasserstein space without computing a full pairwise distance matrix. It leverages approximation schemes such as Sinkhorn distances and linearized optimal transport to accelerate computations, and provides theoretical guarantees on embedding quality even when only finite samples are available. Experiments show that LOT Wassmap achieves accurate embeddings that improve with larger sample sizes while significantly reducing computational cost compared to traditional pairwise‑distance‑based methods.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

• rag