Related papers: Kernel Neural Optimal Transport

Kernel Neural Optimal Transport

URL: http://arxiv.org/abs/2205.15269v1
Date: Mon, 30 May 2022 17:26:06 GMT
Title: Kernel Neural Optimal Transport
Authors: Alexander Korotin, Daniil Selikhanovych, Evgeny Burnaev
Abstract summary: We study the Neural Optimal Transport (NOT) algorithm which uses the general optimal transport formulation and learns transport plans. We show that NOT with the weak quadratic cost might learn fake plans which are not optimal. We show that they provide improved theoretical guarantees and practical performance.
Score: 82.2689844201373
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We study the Neural Optimal Transport (NOT) algorithm which uses the general optimal transport formulation and learns stochastic transport plans. We show that NOT with the weak quadratic cost might learn fake plans which are not optimal. To resolve this issue, we introduce kernel weak quadratic costs. We show that they provide improved theoretical guarantees and practical performance. We test NOT with kernel costs on the unpaired image-to-image translation task.

Related papers

ENOT: Expectile Regularization for Fast and Accurate Training of Neural Optimal Transport [3.0237149871998095]
We present a new approach to accurately and efficiently estimating optimal transportation plan. It is called ExpectileRegularised Neural Transport Optimal (ENOT) ENOT enforces binding conditions on the learning process of dual potentials.
arXiv Detail & Related papers (2024-03-06T15:15:42Z)
Can Decentralized Stochastic Minimax Optimization Algorithms Converge Linearly for Finite-Sum Nonconvex-Nonconcave Problems? [56.62372517641597]
Decentralized minimax optimization has been actively studied in the past few years due to its application in a wide range machine learning. This paper develops two novel decentralized minimax optimization algorithms for the non-strongly-nonconcave problem.
arXiv Detail & Related papers (2023-04-24T02:19:39Z)
Neural Optimal Transport with General Cost Functionals [66.41953045707172]
We introduce a novel neural network-based algorithm to compute optimal transport plans for general cost functionals. As an application, we construct a cost functional to map data distributions while preserving the class-wise structure.
arXiv Detail & Related papers (2022-05-30T20:00:19Z)
Momentum Stiefel Optimizer, with Applications to Suitably-Orthogonal Attention, and Optimal Transport [18.717832661972896]
New approach is proposed based on, for the first time, an interplay between thoughtfully designed continuous and discrete dynamics. Method exactly preserves the manifold structure but does not require commonly used projection or retraction. Its generalization to adaptive learning rates is also demonstrated.
arXiv Detail & Related papers (2022-05-27T18:01:45Z)
Neural Optimal Transport [82.2689844201373]
We present a novel neural-networks-based algorithm to compute optimal transport maps and plans for strong and weak transport costs. We prove that neural networks are universal approximators of transport plans between probability distributions.
arXiv Detail & Related papers (2022-01-28T16:24:13Z)
Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark [133.46066694893318]
We evaluate the performance of neural network-based solvers for optimal transport. We find that existing solvers do not recover optimal transport maps even though they perform well in downstream tasks.
arXiv Detail & Related papers (2021-06-03T15:59:28Z)
Minimax Optimization with Smooth Algorithmic Adversaries [59.47122537182611]
We propose a new algorithm for the min-player against smooth algorithms deployed by an adversary. Our algorithm is guaranteed to make monotonic progress having no limit cycles, and to find an appropriate number of gradient ascents.
arXiv Detail & Related papers (2021-06-02T22:03:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.