Stochastic Incremental Algorithms for Optimal Transport with SON Regularizer

03/09/2019
by   Ashkan Panahi, et al.
0

We introduce a new regularizer for optimal transport (OT) which is tailored to better preserve the class structure. We give the first theoretical guarantees for an OT scheme that respects class structure. We give an accelerated proximal--projection scheme for this formulation with the proximal operator in closed form to give a highly scalable algorithm for computing optimal transport plans. We give a novel argument for the uniqueness of the optimum even in the absence of strong convexity. Our experiments show that the new regularizer preserves class structure better and is more robust compared to previous regularizers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2022

Kernel Neural Optimal Transport

We study the Neural Optimal Transport (NOT) algorithm which uses the gen...
research
05/30/2022

Neural Optimal Transport with General Cost Functionals

We present a novel neural-networks-based algorithm to compute optimal tr...
research
04/12/2021

Efficient Optimal Transport Algorithm by Accelerated Gradient descent

Optimal transport (OT) plays an essential role in various areas like mac...
research
03/10/2020

A mixed finite element discretization of dynamical optimal transport

In this paper we introduce a new class of finite element discretizations...
research
04/12/2021

Metasurfaces and Optimal transport

This paper provides a theoretical and numerical approach to show existen...
research
06/11/2021

JKOnet: Proximal Optimal Transport Modeling of Population Dynamics

Consider a heterogeneous population of points evolving with time. While ...
research
06/20/2023

Learning Costs for Structured Monge Displacements

Optimal transport theory has provided machine learning with several tool...

Please sign up or login with your details

Forgot password? Click here to reset