Wasserstein barycenters are NP-hard to compute

4 January 2021

Papers citing "Wasserstein barycenters are NP-hard to compute"

24 / 24 papers shown

Title
Multi-Output Distributional Fairness via Post-Processing Gang Li Qihang Lin Ayush Ghosh Tianbao Yang 122 0 0 31 Aug 2024
Kullback-Leibler Barycentre of Stochastic Processes S. Jaimungal Silvana M. Pesenti 56 1 0 05 Jul 2024
Energy-Guided Continuous Entropic Barycenter Estimation for General Costs Alexander Kolesov Petr Mokrov Igor Udovichenko Milena Gazdieva G. Pammer Anastasis Kratsios Evgeny Burnaev Alexander Korotin OT 82 2 0 02 Oct 2023
Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent Jason M. Altschuler Sinho Chewi P. Gerber Austin J. Stromme 64 36 0 16 Jun 2021
Hardness results for Multimarginal Optimal Transport problems Jason M. Altschuler Enric Boix-Adserà OT 39 32 0 10 Dec 2020
Polynomial-time algorithms for Multimarginal Optimal Transport problems with structure Jason M. Altschuler Enric Boix-Adserà 29 32 0 07 Aug 2020
Sinkhorn Barycenter via Functional Gradient Descent Zebang Shen Zhenfu Wang Alejandro Ribeiro Hamed Hassani 34 10 0 20 Jul 2020
Estimating Barycenters of Measures in High Dimensions Samuel N. Cohen Michael Arbel M. Deisenroth 120 24 0 14 Jul 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
Debiased Sinkhorn barycenters H. Janati Marco Cuturi Alexandre Gramfort OT 47 57 0 03 Jun 2020
Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm Tianyi Lin Nhat Ho Xi Chen Marco Cuturi Michael I. Jordan 94 53 0 12 Feb 2020
Gradient descent algorithms for Bures-Wasserstein barycenters Sinho Chewi Tyler Maunu Philippe Rigollet Austin J. Stromme 39 87 0 06 Jan 2020
Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithm Giulia Luise Saverio Salzo Massimiliano Pontil C. Ciliberto 28 68 0 30 May 2019
Probabilistic Multilevel Clustering via Composite Transportation Distance Nhat Ho Viet Huynh Dinh Q. Phung Michael I. Jordan 31 21 0 29 Oct 2018
Distilled Wasserstein Learning for Word Embedding and Topic Modeling Hongteng Xu Wenlin Wang Wen Liu Lawrence Carin MedIm FedML 61 85 0 12 Sep 2018
Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representations Sidak Pal Singh Andreas Hug Aymeric Dieuleveut Martin Jaggi OT 55 26 0 29 Aug 2018
Computational Optimal Transport Gabriel Peyré Marco Cuturi OT 189 2,143 0 01 Mar 2018
Multilevel Clustering via Wasserstein Means Nhat Ho X. Nguyen Mikhail Yurochkin Hung Bui Viet Huynh Dinh Q. Phung 41 148 0 13 Jun 2017
Parallel Streaming Wasserstein Barycenters Matthew Staib Sebastian Claici Justin Solomon Stefanie Jegelka 59 89 0 21 May 2017
A fixed-point approach to barycenters in Wasserstein space P. C. Álvarez-Esteban E. del Barrio J. A. Cuesta-Albertos Carlos Matrán 38 191 0 17 Nov 2015
Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support Jianbo Ye Panruo Wu Jianmin Wang Jia Li 40 132 0 30 Sep 2015
Fast Optimal Transport Averaging of Neuroimaging Data Alexandre Gramfort Gabriel Peyré Marco Cuturi OT 54 115 0 30 Mar 2015
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 184 4,251 0 04 Jun 2013