Proximal optimal transport modeling of population dynamics

C Bunne, L Papaxanthos, A Krause… - International …, 2022 - proceedings.mlr.press
We propose a new approach to model the collective dynamics of a population of particles
evolving with time. As is often the case in challenging scientific applications, notably single …

Wasserstein barycenters are NP-hard to compute

JM Altschuler, E Boix-Adsera - SIAM Journal on Mathematics of Data Science, 2022 - SIAM
Computing Wasserstein barycenters (aka optimal transport barycenters) is a fundamental
problem in geometry which has recently attracted considerable attention due to many …

Multimarginal optimal transport with a tree-structured cost and the schrodinger bridge problem

I Haasler, A Ringh, Y Chen, J Karlsson - SIAM Journal on Control and …, 2021 - SIAM
The optimal transport problem has recently developed into a powerful framework for various
applications in estimation and control. Many of the recent advances in the theory and …

Polynomial-time algorithms for multimarginal optimal transport problems with structure

JM Altschuler, E Boix-Adsera - Mathematical Programming, 2023 - Springer
Abstract Multimarginal Optimal Transport (MOT) has attracted significant interest due to
applications in machine learning, statistics, and the sciences. However, in most applications …

[PDF][PDF] Scalable computation of monge maps with general costs

J Fan, S Liu, S Ma, Y Chen, H Zhou - arXiv preprint arXiv …, 2021 - researchgate.net
Monge map refers to the optimal transport map between two probability distributions and
provides a principled approach to transform one distribution to another. In spite of the rapid …

On the complexity of the optimal transport problem with graph-structured cost

J Fan, I Haasler, J Karlsson… - … conference on artificial …, 2022 - proceedings.mlr.press
Multi-marginal optimal transport (MOT) is a generalization of optimal transport to multiple
marginals. Optimal transport has evolved into an important tool in many machine learning …

Hardness results for multimarginal optimal transport problems

JM Altschuler, E Boix-Adsera - Discrete Optimization, 2021 - Elsevier
Abstract Multimarginal Optimal Transport (MOT) is the problem of linear programming over
joint probability distributions with fixed marginals. A key issue in many applications is the …

Modified gannet optimization algorithm for reducing system operation cost in engine parts industry with pooling management and transport optimization

M Alkahtani, MH Abidi, HSB Obaid, O Alotaik - Sustainability, 2023 - mdpi.com
Due to the emergence of technology, electric motors (EMs), an essential part of electric
vehicles (which basically act as engines), have become a pivotal component in modern …

Hilbert curve projection distance for distribution comparison

T Li, C Meng, H Xu, J Yu - IEEE Transactions on Pattern …, 2024 - ieeexplore.ieee.org
Distribution comparison plays a central role in many machine learning tasks like data
classification and generative modeling. In this study, we propose a novel metric, called …

Convergence rate of entropy-regularized multi-marginal optimal transport costs

L Nenna, P Pegon - Canadian Journal of Mathematics, 2023 - cambridge.org
We investigate the convergence rate of multi-marginal optimal transport costs that are
regularized with the Boltzmann–Shannon entropy, as the noise parameter costs satisfying …