AI Chat AI Image Generator AI Video Text to Speech

Approximation of Wasserstein distance with Transshipment

01/27/2019

∙

by Nicolas Papadakis, et al.

∙

∙

An algorithm for approximating the p-Wasserstein distance between histograms defined on unstructured discrete grids is presented. It is based on the computation of a barycenter constrained to be supported on a low dimensional subspace, which corresponds to a transshipment problem. A multi-scale strategy is also considered. The method provides sparse transport matrices and can be applied to large scale and non structured data.

research

∙ 09/16/2019

Estimation of Wasserstein distances in the Spiked Transport Model

We propose a new statistical model, the spiked transport model, which fo...

0 Jonathan Niles-Weed, et al. ∙

research

∙ 04/27/2020

Hierarchical Low-Rank Approximation of Regularized Wasserstein distance

Sinkhorn divergence is a measure of dissimilarity between two probabilit...

0 Mohammad Motamed, et al. ∙

research

∙ 09/02/2021

dbcsp: User-friendly R package for Distance-Based Common Spacial Patterns

Common Spacial Patterns (CSP) is a widely used method to analyse electro...

0 Itsaso Rodriguez, et al. ∙

research

∙ 01/25/2019

Subspace Robust Wasserstein distances

Making sense of Wasserstein distances between discrete measures in high-...

0 François-Pierre Paty, et al. ∙

research

∙ 11/16/2021

Ocean Mover's Distance: Using Optimal Transport for Analyzing Oceanographic Data

Modern ocean datasets are large, multi-dimensional, and inherently spati...

0 Sangwon Hyun, et al. ∙

research

∙ 12/09/2020

A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance

The Wasserstein distance has become increasingly important in machine le...

0 Minhui Huang, et al. ∙

research

∙ 01/02/2019

Statistical inference for Bures-Wasserstein barycenters

In this work we introduce the concept of Bures-Wasserstein barycenter Q_...

0 Alexey Kroshnin, et al. ∙