On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport

09/16/2023
by   Klas Modin, et al.
0

The Sinkhorn algorithm is a numerical method for the solution of optimal transport problems. Here, I give a brief survey of this algorithm, with a strong emphasis on its geometric origin: it is natural to view it as a discretization, by standard methods, of a non-linear integral equation. In the appendix, I also provide a short summary of an early result of Beurling on product measures, directly related to the Sinkhorn algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2020

Optimal transport: discretization and algorithms

This chapter describes techniques for the numerical resolution of optima...
research
07/06/2020

On the Connection between Dynamical Optimal Transport and Functional Lifting

Functional lifting methods provide a tool for approximating solutions of...
research
06/29/2022

When Optimal Transport Meets Information Geometry

Information geometry and optimal transport are two distinct geometric fr...
research
09/19/2019

Unconditional convergence for discretizations of dynamical optimal transport

The dynamical formulation of optimal transport, also known as Benamou-Br...
research
09/01/2022

Efficient preconditioners for solving dynamical optimal transport via interior point methods

In this paper we address the numerical solution of the quadratic optimal...
research
10/28/2021

Homogenisation of dynamical optimal transport on periodic graphs

This paper deals with the large-scale behaviour of dynamical optimal tra...
research
06/09/2022

Symmetrized semi-discrete optimal transport

Interpolating between measures supported by polygonal or polyhedral doma...

Please sign up or login with your details

Forgot password? Click here to reset