Papers › PMIC: Improving Multi-Agent Reinforcement Learning with Progressive Mutual Information...

PMIC: Improving Multi-Agent Reinforcement Learning with Progressive Mutual Information Collaboration

16 Mar 2022arXiv:2203.08553archive 2025-07-28

Pengyi Li, Hongyao Tang, Tianpei Yang, Xiaotian Hao, Tong Sang, Yan Zheng, Jianye Hao, Matthew E. Taylor, Wenyuan Tao, Zhen Wang, Fazl Barez

Learning to collaborate is critical in Multi-Agent Reinforcement Learning (MARL). Previous works promote collaboration by maximizing the correlation of agents' behaviors, which is typically characterized by Mutual Information (MI) in different forms. However, we reveal sub-optimal collaborative behaviors also emerge with strong correlations, and simply maximizing the MI can, surprisingly, hinder the learning towards better collaboration. To address this issue, we propose a novel MARL framework, called Progressive Mutual Information Collaboration (PMIC), for more effective MI-driven collaboration. PMIC uses a new collaboration criterion measured by the MI between global states and joint actions. Based on this criterion, the key idea of PMIC is maximizing the MI associated with superior collaborative behaviors and minimizing the MI associated with inferior ones. The two MI objectives play complementary roles by facilitating better collaborations while avoiding falling into sub-optimal ones. Experiments on a wide range of MARL benchmarks show the superior performance of PMIC compared with other algorithms.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2203.08553")

Code

Syntology Ran 8 of 9 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · our draft was wrong; 2 ran · fixture could not drive it; 5 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

yeshenpy/pmic officialmentioned in papermentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 8 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
2ran · fixture could not drive it
5ran
1unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from yeshenpy/pmic. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Actor yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 02d8b297accf97de · report
CLUB yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · metamorphic tier: invariant fingerprinted MIT (permissive) · 93f26c6f16a8c0ae · report
Critic yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · metamorphic tier: invariant MIT (permissive) · 0b5742fd1596a2a9 · report
NEW_MINE yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran MIT (permissive) · fe832e6e436cb7d8 · report
OUNoise yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · metamorphic tier: well formed MIT (permissive) · 5a6b141fd404c7c4 · report
fenchel_dual_loss yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · our draft was wrong MIT (permissive) · dc127827c3f6691e · report
get_negative_expectation yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · fixture could not drive it MIT (permissive) · 640aa7bb79c50862 · report
get_positive_expectation yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository ran · fixture could not drive it MIT (permissive) · 0edef8661a209cf5 · report
MA_T_DDPG yeshenpy/pmic/algorithms/mpe_new_maxminMADDPG.py official repository unverified MIT (permissive) · 96cedade50014de1 · report

Tasks

Multi-agent Reinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections