Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure

7 August 2020

Papers citing "Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure"

22 / 22 papers shown

Title
Fast computation of the TGOSPA metric for multiple target tracking via unbalanced optimal transport Viktor Nevelius Wernholm Alfred Wärnsäter Axel Ringh OT 76 0 0 12 Mar 2025
Stochastic Learning of Computational Resource Usage as Graph Structured Multimarginal Schrödinger Bridge Georgiy A. Bondar Robert Gifford Linh Thi Xuan Phan Abhishek Halder 65 0 0 21 May 2024
Wasserstein barycenters are NP-hard to compute Jason M. Altschuler Enric Boix-Adserà OT 213 43 0 04 Jan 2021
Hardness results for Multimarginal Optimal Transport problems Jason M. Altschuler Enric Boix-Adserà OT 41 32 0 10 Dec 2020
Incremental inference of collective graphical models Rahul Singh Isabel Haasler Qinsheng Zhang Johan Karlsson Yongxin Chen 21 5 0 26 Jun 2020
Multi-marginal optimal transport and probabilistic graphical models Isabel Haasler Rahul Singh Qinsheng Zhang Johan Karlsson Yongxin Chen OT 50 42 0 25 Jun 2020
Probabilistic Optimal Transport based on Collective Graphical Models Yasunori Akagi Yusuke Tanaka Tomoharu Iwata Takeshi Kurashima Hiroyuki Toda OT 20 2 0 16 Jun 2020
Tensor optimal transport, distance between sets of measures and tensor scaling S. Friedland OT 20 11 0 02 May 2020
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem Gonzalo E. Mena Jonathan Niles-Weed OT 48 166 0 28 May 2019
Massively scalable Sinkhorn distances via the Nyström method Jason M. Altschuler Francis R. Bach Alessandro Rudi Jonathan Niles-Weed 46 109 0 12 Dec 2018
Sample Complexity of Sinkhorn divergences Aude Genevay Lénaïc Chizat Francis R. Bach Marco Cuturi Gabriel Peyré OT 75 288 0 05 Oct 2018
Entropic optimal transport is maximum-likelihood deconvolution Philippe Rigollet Jonathan Niles-Weed OT 61 78 0 14 Sep 2018
Computational Optimal Transport Gabriel Peyré Marco Cuturi OT 203 2,146 0 01 Mar 2018
Smooth and Sparse Optimal Transport Mathieu Blondel Vivien Seguy Antoine Rolet OT 59 175 0 17 Oct 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration Jason M. Altschuler Jonathan Niles-Weed Philippe Rigollet OT 66 590 0 26 May 2017
Tsallis Regularized Optimal Transport and Ecological Inference Boris Muzellec Richard Nock Giorgio Patrini Frank Nielsen OT 46 52 0 15 Sep 2016
Optimal Transport for Domain Adaptation Nicolas Courty Rémi Flamary D. Tuia A. Rakotomamonjy OT OOD 128 1,119 0 02 Jul 2015
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions A. Belloni Tengyuan Liang Hariharan Narayanan Alexander Rakhlin 143 77 0 28 Jan 2015
On the rate of convergence in Wasserstein distance of the empirical measure N. Fournier Arnaud Guillin 173 1,142 0 07 Dec 2013
Fast Computation of Wasserstein Barycenters Marco Cuturi Arnaud Doucet OT 86 740 0 16 Oct 2013
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances Marco Cuturi OT 201 4,258 0 04 Jun 2013
Learning with Submodular Functions: A Convex Optimization Perspective Francis R. Bach 127 477 0 28 Nov 2011