Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey

• URL: http://arxiv.org/abs/2305.05080v2
• Date: Fri, 22 Mar 2024 01:17:08 GMT
• Title: Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey
• Authors: Abdelwahed Khamis, Russell Tsuchida, Mohamed Tarek, Vivien Rolland, Lars Petersson,
• Abstract summary: 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.
• Score: 15.500897098518989
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Optimal Transport (OT) is a mathematical framework that first emerged in the eighteenth century and has led to a plethora of methods for answering many theoretical and applied questions. The last decade has been a witness to the remarkable contributions of this classical optimization problem to machine learning. This paper is about where and how optimal transport is used in machine learning with a focus on the question of scalable optimal transport. We provide a comprehensive survey of optimal transport while ensuring an accessible presentation as permitted by the nature of the topic and the context. First, we 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. We conduct a systematic analysis of the methods used in the literature for scaling OT and present the findings in a unified taxonomy. We conclude with presenting some open challenges and discussing potential future research directions. A live repository of related OT research papers is maintained in https://github.com/abdelwahed/OT_for_big_data.git

Related papers

• Rethinking Optimal Transport in Offline Reinforcement Learning [64.56896902186126]
  In offline reinforcement learning, the data is provided by various experts and some of them can be sub-optimal. To extract an efficient policy, it is necessary to emphstitch the best behaviors from the dataset. We present an algorithm that aims to find a policy that maps states to a emphpartial distribution of the best expert actions for each given state.
  arXiv  Detail & Related papers  (2024-10-17T22:36:43Z)
• Active Exploration via Experiment Design in Markov Chains [86.41407938210193]
  A key challenge in science and engineering is to design experiments to learn about some unknown quantity of interest. We propose an algorithm that efficiently selects policies whose measurement allocation converges to the optimal one. In addition to our theoretical analysis, we showcase our framework on applications in ecological surveillance and pharmacology.
  arXiv  Detail & Related papers  (2022-06-29T00:04:40Z)
• Inductive Semi-supervised Learning Through Optimal Transport [0.0]
  The proposed approach, called Optimal Transport Induction (OTI), extends efficiently an optimal transport based transductive algorithm (OTP) to inductive tasks. A series of experiments are conducted on several datasets in order to compare the proposed approach with state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-12-14T09:52:01Z)
• A Survey on Optimal Transport for Machine Learning: Theory and Applications [1.1279808969568252]
  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.
  arXiv  Detail & Related papers  (2021-06-03T16:10:42Z)
• 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)
• A contribution to Optimal Transport on incomparable spaces [4.873362301533825]
  This thesis proposes to study the complex scenario in which the different data belong to incomparable spaces. This thesis proposes a set of Optimal Transport tools for these different cases.
  arXiv  Detail & Related papers  (2020-11-09T14:13:52Z)
• MinMax Methods for Optimal Transport and Beyond: Regularization, Approximation and Numerics [6.09170287691728]
  Theoretically, the focus is on fitting a large class of problems into a single MinMax framework. We show that regularization techniques justify the utilization of neural networks to solve such problems.
  arXiv  Detail & Related papers  (2020-10-22T07:43:51Z)
• A Survey on Large-scale Machine Learning [67.6997613600942]
  Machine learning can provide deep insights into data, allowing machines to make high-quality predictions. Most sophisticated machine learning approaches suffer from huge time costs when operating on large-scale data. Large-scale Machine Learning aims to learn patterns from big data with comparable performance efficiently.
  arXiv  Detail & Related papers  (2020-08-10T06:07:52Z)
• A Review on Modern Computational Optimal Transport Methods with Applications in Biomedical Research [9.658739280513158]
  We present some cutting-edge computational optimal transport methods with a focus on the regularization-based methods and the projection-based methods. We discuss their real-world applications in biomedical research.
  arXiv  Detail & Related papers  (2020-08-07T05:33:54Z)
• A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention [96.77554122595578]
  We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference. Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
  arXiv  Detail & Related papers  (2020-06-22T08:35:58Z)
• Feature Robust Optimal Transport for High-dimensional Data [125.04654605998618]
  We propose feature-robust optimal transport (FROT) for high-dimensional data, which solves high-dimensional OT problems using feature selection to avoid the curse of dimensionality. We show that the FROT algorithm achieves state-of-the-art performance in real-world semantic correspondence datasets.
  arXiv  Detail & Related papers  (2020-05-25T14:07:16Z)

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.