mlsanityData to 13 Oct 2026

Information-Theoretic Equivalence of Entropic Multi-Marginal Optimal Transport: A Theory for Multi-Agent Communication

arXiv 2208.10256 ↗First posted 22 Aug 2022cs.IT cs.AI cs.ROcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose our information-theoretic equivalence of entropic multi-marginal optimal transport (MOT). This equivalence can be easily reduced to the case of entropic optimal transport (OT). Because OT is widely used to compare differences between knowledge or beliefs, we apply this result to the communication between agents with different beliefs. Our results formally prove the statement that entropic OT is information-theoretically optimal given by Wang et al. [2020] and generalize it to the multi-agent case. We believe that our work can shed light on OT theory in future multi-agent teaming systems.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 18 of its 51 references that are in the map. First posted on arXiv 22 Aug 2022.

Builds on

18 of 51 references.

References · 18

  1. 2020Language Models are Few-Shot Learnerscited by 32,320
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,043
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,295
  4. 2016Cooperative Inverse Reinforcement Learningcited by 299
  5. 2020Deep Learning Enabled Semantic Communication Systemscited by 289
  6. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 288
  7. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 281
  8. 2022Multi-Game Decision Transformerscited by 212
  9. 20206G Networks: Beyond Shannon Towards Semantic and Goal-Oriented Communicationscited by 112
  10. 2020Semantics-Empowered Communication for Networked Intelligent Systemscited by 62
  11. 2021What is Semantic Communication? A View on Conveying Meaning in the Era of Machine Intelligencecited by 50
  12. 2018Policy Optimization as Wasserstein Gradient Flowscited by 34
6 more
  1. 2019A mathematical theory of cooperative communicationcited by 23
  2. 2020Multi-marginal optimal transport and probabilistic graphical modelscited by 13
  3. 2020Information Constrained Optimal Transport: From Talagrand, to Marton, to Covercited by 8
  4. 2017Optimal Cooperative Inferencecited by 7
  5. 2018Generalizing the theory of cooperative inferencecited by 4
  6. 2021Generalized Talagrand Inequality for Sinkhorn Distance using Entropy Power Inequalitycited by 1

Built on by

Not cited yet.