Regularized Optimal Transport and the Rot Mover's Distance

10/20/2016
by   Arnaud Dessein, et al.
0

This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed regularization based on the Boltzmann-Shannon entropy related to the Kullback-Leibler divergence, and solved with the Sinkhorn-Knopp algorithm. We call the regularized optimal transport distance the rot mover's distance in reference to the classical earth mover's distance. We develop two generic schemes that we respectively call the alternate scaling algorithm and the non-negative alternate scaling algorithm, to compute efficiently the regularized optimal plans depending on whether the domain of the regularizer lies within the non-negative orthant or not. These schemes are based on Dykstra's algorithm with alternate Bregman projections, and further exploit the Newton-Raphson method when applied to separable divergences. We enhance the separable case with a sparse extension to deal with high data dimensions. We also instantiate our proposed framework and discuss the inherent specificities for well-known regularizers and statistical divergences in the machine learning and information geometry communities. Finally, we demonstrate the merits of our methods with experiments using synthetic data to illustrate the effect of different regularizers and penalties on the solutions, as well as real-world data for a pattern recognition application to audio scene classification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2023

Error estimate for regularized optimal transport problems via Bregman divergence

Regularization by the Shannon entropy enables us to efficiently and appr...
research
07/02/2022

Exponential Convergence of Sinkhorn Under Regularization Scheduling

The optimal transport (OT) problem or earth mover's distance has wide ap...
research
04/10/2020

Full waveform inversion with unbalanced optimal transport distance

Full waveform inversion (FWI) is an important and popular technique in s...
research
05/11/2023

Generalized Iterative Scaling for Regularized Optimal Transport with Affine Constraints: Application Examples

We demonstrate the relevance of an algorithm called generalized iterativ...
research
03/14/2023

Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers

Regularized discrete optimal transport (OT) is a powerful tool to measur...
research
06/06/2023

Minimum intrinsic dimension scaling for entropic optimal transport

Motivated by the manifold hypothesis, which states that data with a high...
research
11/18/2022

Mirror Sinkhorn: Fast Online Optimization on Transport Polytopes

Optimal transport has arisen as an important tool in machine learning, a...

Please sign up or login with your details

Forgot password? Click here to reset