SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2003.06709 · 2020

FACMAC: Factored Multi-Agent Centralised Policy Gradients

arXiv · PDF · Open in the Atlas

Code that ran

2 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2003.06709.json · badge: /api/ran/2003.06709.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
schroederdewitt/multiagent_mujoco canonical (classifier label)
classifier basis: census
2 ran · 2 no recorded run
FunctionStatusWhere it lives
convert Ran
ran; our contract draft was wrong, not the code
schroederdewitt/multiagent_mujoco/multiagent_mujoco/multiagentenv.py
code served (permissive licence) · get_code("9d0e7c23576a092f")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned GenericDict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
from collections import namedtuple

torch.manual_seed(0)

# The function convert() takes a dictionary and converts it to a namedtuple
# It calls dictionary.keys() and uses **dictionary to unpack it
# So we need a valid dictionary with string keys

test_dict = {
    'name': 'test_model',
    'value': 42,
    'tensor': torch.randn(2, 4),
    'list': [1, 2, 3],
    'nested': {'key': 'value'}
}

ARGS = {
    'dictionary': test_dict
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type GenericDict — a GenericDict output has no array shape of its own; none is stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
get_joints_at_kdist Ran
ran on a synthesized input
schroederdewitt/multiagent_mujoco/multiagent_mujoco/obsk.py
code served (permissive licence) · get_code("b740cb6f99054211")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
import numpy as np

class Joint:
    def __init__(self, label, joint_id):
        self.label = label
        self.id = joint_id
    
    def __hash__(self):
        return hash(self.id)
    
    def __eq__(self, other):
        return self.id == other.id
    
    def __repr__(self):
        return f"Joint({self.label})"

class Hyperedge:
    def __init__(self, edges_set):
        self.edges = edges_set
    
    def __contains__(self, item):
        return item in self.edges

# Create some Joint objects
joint_0 = Joint("joint_0", 0)
joint_1 = Joint("joint_1", 1)
joint_2 = Joint("joint_2", 2)
joint_3 = Joint("joint_3", 3)
joint_4 = Joint("joint_4", 4)
joint_5 = Joint("joint_5", 5)

# Create agent_partitions: list of joint tuples in order of agent ids
# agent_id 0 has joints [joint_0, joint_1]
# agent_id 1 has joints [joint_2, joint_3]
agent_partitions = [
    [joint_0, joint_1],
    [joint_2, joint_3]
]

# Create hyperedges: list of hyperedge objects with edges attribute
# Each hyperedge connects joints together
hyperedges = [
    Hyperedge({joint_0, joint_2}),
    Hyperedge({joint_2, joint_4}),
    Hyperedge({joint_1, joint_3}),
    Hyperedge({joint_3, joint_5})
]

ARGS = {
    "agent_id": 0,
    "agent_partitions": agent_partitions,
    "hyperedges": hyperedges,
    "k": 2,
    "kagents": False
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type dict — a dict output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a dict output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
build_obs Not yet run
unverified (harvested, no recorded run)
schroederdewitt/multiagent_mujoco/multiagent_mujoco/obsk.py
code served (permissive licence) · get_code("7b68f30bd920cce1")
How it ran

no invocation recorded.

get_parts_and_edges Not yet run
unverified (harvested, no recorded run)
schroederdewitt/multiagent_mujoco/multiagent_mujoco/obsk.py
code served (permissive licence) · get_code("f61ec31ccd82ad82")
How it ran

no invocation recorded.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 1 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
convert 2 other papers
2 later
2009.12293 (2020-09)
robosuite: A Modular Simulation Framework and Benchmark for Robot Learning
2110.02793 (2021-10)
Multi-Agent Constrained Policy Optimisation
build_obs 1 other paper
1 later
2110.02793 (2021-10)
Multi-Agent Constrained Policy Optimisation
get_joints_at_kdist 1 other paper
1 later
2110.02793 (2021-10)
Multi-Agent Constrained Policy Optimisation

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We propose FACtored Multi-Agent Centralised policy gradients (FACMAC), a new method for cooperative multi-agent reinforcement learning in both discrete and continuous action spaces. Like MADDPG, a popular multi-agent actor-critic method, our approach uses deep deterministic policy gradients to learn policies. However, FACMAC learns a centralised but factored critic, which combines per-agent utilities into the joint action-value function via a non-linear monotonic function, as in QMIX, a popular multi-agent Q-learning algorithm. However, unlike QMIX, there are no inherent constraints on factoring the critic. We thus also employ a nonmonotonic factorisation and empirically demonstrate that its increased representational capacity allows it to solve some tasks that cannot be solved with monolithic, or monotonically factored critics. In addition, FACMAC uses a centralised policy gradient estimator that optimises over the entire joint action space, rather than optimising over each agent's action space separately as in MADDPG. This allows for more coordinated policy changes and fully reaps the benefits of a centralised critic. We evaluate FACMAC on variants of the multi-agent particle environments, a novel multi-agent MuJoCo benchmark, and a challenging set of StarCraft II micromanagement tasks. Empirical results demonstrate FACMAC's superior performance over MADDPG and other baselines on all three domains.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2003.06709")
get_code_for_paper("2003.06709")
have("2003.06709")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2003.06709.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2003.06709.svg)](https://syntology.ai/paper/2003.06709)

Connect an agent — have() is free.