Multi-Marginal Optimal Transport and Probabilistic Graphical Models

DOI10.1109/TIT.2021.3077465zbMath1475.49057arXiv2006.14113MaRDI QIDQ5001817

Yongxin Chen, Johan Karlsson, Qinsheng Zhang, Rahul Singh, Isabel Haasler

Publication date: 23 July 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.14113

zbMATH Keywords

probabilistic graphical modelsentropy regularized multi-marginal optimal transport

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Probabilistic graphical models (62H22) Optimal transportation (49Q22)

Related Items (9)

Wasserstein Barycenters Are NP-Hard to Compute ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ A family of pairwise multi-marginal optimal transports that define a generalized metric ⋮ Monge-Kantorovich optimal transport through constrictions and flow-rate constraints ⋮ Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems ⋮ Hardness results for multimarginal optimal transport problems ⋮ Learning hidden Markov models from aggregate observations ⋮ Feedback particle filter for collective inference ⋮ Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem

This page was built for publication: Multi-Marginal Optimal Transport and Probabilistic Graphical Models