A Sinkhorn-Newton method for entropic optimal transport

10/18/2017
by   Christoph Brauer, et al.
0

We consider the entropic regularization of discretized optimal transport and propose to solve its optimality conditions via a logarithmic Newton iteration. We show a quadratic convergence rate and validate numerically that the method compares favorably with the more commonly used Sinkhorn--Knopp algorithm for small regularization strength. We further investigate numerically the robustness of the proposed method with respect to parameters such as the mesh size of the discretization.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/02/2020

Optimal transport: discretization and algorithms

This chapter describes techniques for the numerical resolution of optima...
07/05/2017

An algorithm for optimal transport between a simplex soup and a point cloud

We propose a numerical method to find the optimal transport map between ...
08/30/2019

A Newton algorithm for semi-discrete optimal transport with storage fees and quantitative convergence of cells

In this paper we will continue analysis of the semi-discrete optimal tra...
04/12/2021

Metasurfaces and Optimal transport

This paper provides a theoretical and numerical approach to show existen...
09/17/2019

Distributed Function Minimization in Apache Spark

We report on an open-source implementation for distributed function mini...
02/03/2022

Toric Geometry of Entropic Regularization

Entropic regularization is a method for large-scale linear programming. ...
10/22/2021

A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation

We develop a fast and reliable method for solving large-scale optimal tr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.