A Survey on Optimal Transport for Machine Learning: Theory and Applications

• URL: http://arxiv.org/abs/2106.01963v1
• Date: Thu, 3 Jun 2021 16:10:42 GMT
• Title: A Survey on Optimal Transport for Machine Learning: Theory and Applications
• Authors: Luis Caicedo Torres, Luiz Manella Pereira, M. Hadi Amini
• Abstract summary: Optimal Transport (OT) theory has seen an increasing amount of attention from the computer science community. We present a brief introduction and history, a survey of previous work and propose directions of future study.
• Score: 1.1279808969568252
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Optimal Transport (OT) theory has seen an increasing amount of attention from the computer science community due to its potency and relevance in modeling and machine learning. It introduces means that serve as powerful ways to compare probability distributions with each other, as well as producing optimal mappings to minimize cost functions. In this survey, we present a brief introduction and history, a survey of previous work and propose directions of future study. We will begin by looking at the history of optimal transport and introducing the founders of this field. We then give a brief glance into the algorithms related to OT. Then, we will follow up with a mathematical formulation and the prerequisites to understand OT. These include Kantorovich duality, entropic regularization, KL Divergence, and Wassertein barycenters. Since OT is a computationally expensive problem, we then introduce the entropy-regularized version of computing optimal mappings, which allowed OT problems to become applicable in a wide range of machine learning problems. In fact, the methods generated from OT theory are competitive with the current state-of-the-art methods. We follow this up by breaking down research papers that focus on image processing, graph learning, neural architecture search, document representation, and domain adaptation. We close the paper with a small section on future research. Of the recommendations presented, three main problems are fundamental to allow OT to become widely applicable but rely strongly on its mathematical formulation and thus are hardest to answer. Since OT is a novel method, there is plenty of space for new research, and with more and more competitive methods (either on an accuracy level or computational speed level) being created, the future of applied optimal transport is bright as it has become pervasive in machine learning.

Related papers

• Quantum Theory and Application of Contextual Optimal Transport [2.160404814399144]
  We propose a first-of-its-kind quantum computing formulation for amortized optimization of contextualized transportation plans. We report a performance that cannot be matched with our classical neural OT approach.
  arXiv  Detail & Related papers  (2024-02-22T22:03:16Z)
• Energy-Guided Continuous Entropic Barycenter Estimation for General Costs [95.33926437521046]
  We propose a novel algorithm for approximating the continuous Entropic OT (EOT) barycenter for arbitrary OT cost functions. Our approach is built upon the dual reformulation of the EOT problem based on weak OT.
  arXiv  Detail & Related papers  (2023-10-02T11:24:36Z)
• Building the Bridge of Schr\"odinger: A Continuous Entropic Optimal Transport Benchmark [96.06787302688595]
  We propose a novel way to create pairs of probability distributions for which the ground truth OT solution is known by the construction. We use these benchmark pairs to test how well existing neural EOT/SB solvers actually compute the EOT solution.
  arXiv  Detail & Related papers  (2023-06-16T20:03:36Z)
• Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey [15.500897098518989]
  This paper is about where and how optimal transport is used in machine learning. We first explain the optimal transport background and introduce different flavors (i.e., mathematical formulations), properties, and notable applications. We then address the fundamental question of how to scale optimal transport to cope with the current demands of big and high dimensional data.
  arXiv  Detail & Related papers  (2023-05-08T22:43:16Z)
• Energy-guided Entropic Neural Optimal Transport [100.20553612296024]
  Energy-based models (EBMs) are known in the Machine Learning community for decades. We bridge the gap between EBMs and Entropy-regularized OT. In practice, we validate its applicability in toy 2D and image domains.
  arXiv  Detail & Related papers  (2023-04-12T18:20:58Z)
• Entropic Neural Optimal Transport via Diffusion Processes [105.34822201378763]
  We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step.
  arXiv  Detail & Related papers  (2022-11-02T14:35:13Z)
• Low-rank Optimal Transport: Approximation, Statistics and Debiasing [51.50788603386766]
  Low-rank optimal transport (LOT) approach advocated in citescetbon 2021lowrank LOT is seen as a legitimate contender to entropic regularization when compared on properties of interest. We target each of these areas in this paper in order to cement the impact of low-rank approaches in computational OT.
  arXiv  Detail & Related papers  (2022-05-24T20:51:37Z)
• Learning to Optimize: A Primer and A Benchmark [94.29436694770953]
  Learning to optimize (L2O) is an emerging approach that leverages machine learning to develop optimization methods. This article is poised to be the first comprehensive survey and benchmark of L2O for continuous optimization.
  arXiv  Detail & Related papers  (2021-03-23T20:46:20Z)
• Manifold optimization for optimal transport [34.88495814664577]
  Optimal transport (OT) has recently found widespread interest in machine learning. We discuss how to approach OT problems within the framework of the manifold optimization. We make available the Manifold optimization-based Optimal Transport, or MOT, repository with codes useful in solving OT problems in Python and Matlab.
  arXiv  Detail & Related papers  (2021-03-01T10:49:19Z)
• Regularized Optimal Transport is Ground Cost Adversarial [34.81915836064636]
  We show that regularization of the optimal transport problem can be interpreted as ground cost adversarial. This gives access to a robust dissimilarity measure on the ground space, which can in turn be used in other applications.
  arXiv  Detail & Related papers  (2020-02-10T17:28:35Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.