Why do Coverage Gradient Strategies work so effectively in Cooperative MARL? Proof from Coverage Illustration

In cooperative multi-agent reinforcement studying (MARL), as a consequence of its on-policy nature, coverage gradient (PG) strategies are sometimes believed to be much less pattern environment friendly than worth decomposition (VD) strategies, that are off-policy. Nevertheless, some current empirical research exhibit that with correct enter illustration and hyper-parameter tuning, multi-agent PG can obtain surprisingly sturdy efficiency in comparison with off-policy VD strategies.

Why may PG strategies work so effectively? On this publish, we’ll current concrete evaluation to point out that in sure situations, e.g., environments with a extremely multi-modal reward panorama, VD will be problematic and result in undesired outcomes. Against this, PG strategies with particular person insurance policies can converge to an optimum coverage in these instances. As well as, PG strategies with auto-regressive (AR) insurance policies can be taught multi-modal insurance policies.

Determine 1: totally different coverage illustration for the 4-player permutation recreation.

CTDE in Cooperative MARL: VD and PG strategies

Centralized coaching and decentralized execution (CTDE) is a well-liked framework in cooperative MARL. It leverages world info for simpler coaching whereas preserving the illustration of particular person insurance policies for testing. CTDE will be carried out by way of worth decomposition (VD) or coverage gradient (PG), main to 2 several types of algorithms.

VD strategies be taught native Q networks and a mixing operate that mixes the native Q networks to a world Q operate. The blending operate is often enforced to fulfill the Particular person-International-Max (IGM) precept, which ensures the optimum joint motion will be computed by greedily selecting the optimum motion domestically for every agent.

Against this, PG strategies immediately apply coverage gradient to be taught a person coverage and a centralized worth operate for every agent. The worth operate takes as its enter the worldwide state (e.g., MAPPO) or the concatenation of all of the native observations (e.g., MADDPG), for an correct world worth estimate.

The permutation recreation: a easy counterexample the place VD fails

We begin our evaluation by contemplating a stateless cooperative recreation, specifically the permutation recreation. In an -player permutation recreation, every agent can output actions . Brokers obtain reward if their actions are mutually totally different, i.e., the joint motion is a permutation over ; in any other case, they obtain reward. Observe that there are symmetric optimum methods on this recreation.

Determine 2: the 4-player permutation recreation.

Allow us to deal with the 2-player permutation recreation for our dialogue. On this setting, if we apply VD to the sport, the worldwide Q-value will factorize to

the place and are native Q-functions, is the worldwide Q-function, and is the blending operate that, as required by VD strategies, satisfies the IGM precept.

Determine 3: high-level instinct on why VD fails within the 2-player permutation recreation.

We formally show that VD can not characterize the payoff of the 2-player permutation recreation by contradiction. If VD strategies had been in a position to characterize the payoff, we’d have

Nevertheless, if both of those two brokers have totally different native Q values, e.g. , then based on the IGM precept, we will need to have

In any other case, if and , then

Consequently, worth decomposition can not characterize the payoff matrix of the 2-player permutation recreation.

What about PG strategies? Particular person insurance policies can certainly characterize an optimum coverage for the permutation recreation. Furthermore, stochastic gradient descent can assure PG to converge to certainly one of these optima underneath delicate assumptions. This means that, despite the fact that PG strategies are much less well-liked in MARL in contrast with VD strategies, they are often preferable in sure instances which are frequent in real-world functions, e.g., video games with a number of technique modalities.

We additionally comment that within the permutation recreation, to be able to characterize an optimum joint coverage, every agent should select distinct actions. Consequently, a profitable implementation of PG should be certain that the insurance policies are agent-specific. This may be carried out through the use of both particular person insurance policies with unshared parameters (known as PG-Ind in our paper), or an agent-ID conditioned coverage (PG-ID).

PG outperform greatest VD strategies on well-liked MARL testbeds

Going past the easy illustrative instance of the permutation recreation, we prolong our examine to well-liked and extra sensible MARL benchmarks. Along with StarCraft Multi-Agent Problem (SMAC), the place the effectiveness of PG and agent-conditioned coverage enter has been verified, we present new ends in Google Analysis Soccer (GRF) and multi-player Hanabi Problem.

Determine 4: (high) successful charges of PG strategies on GRF; (backside) greatest and common analysis scores on Hanabi-Full.

In GRF, PG strategies outperform the state-of-the-art VD baseline (CDS) in 5 situations. Apparently, we additionally discover that particular person insurance policies (PG-Ind) with out parameter sharing obtain comparable, generally even larger successful charges, in comparison with agent-specific insurance policies (PG-ID) in all 5 situations. We consider PG-ID within the full-scale Hanabi recreation with various numbers of gamers (2-5 gamers) and evaluate them to SAD, a powerful off-policy Q-learning variant in Hanabi, and Worth Decomposition Networks (VDN). As demonstrated within the above desk, PG-ID is ready to produce outcomes akin to or higher than the perfect and common rewards achieved by SAD and VDN with various numbers of gamers utilizing the identical variety of setting steps.

Past larger rewards: studying multi-modal conduct by way of auto-regressive coverage modeling

Apart from studying larger rewards, we additionally examine how you can be taught multi-modal insurance policies in cooperative MARL. Let’s return to the permutation recreation. Though we have now proved that PG can successfully be taught an optimum coverage, the technique mode that it lastly reaches can extremely depend upon the coverage initialization. Thus, a pure query will probably be:

Can we be taught a single coverage that may cowl all of the optimum modes?

Within the decentralized PG formulation, the factorized illustration of a joint coverage can solely characterize one specific mode. Due to this fact, we suggest an enhanced solution to parameterize the insurance policies for stronger expressiveness — the auto-regressive (AR) insurance policies.

Determine 5: comparability between particular person insurance policies (PG) and auto-regressive insurance policies (AR) within the 4-player permutation recreation.

Formally, we factorize the joint coverage of brokers into the type of

the place the motion produced by agent relies upon by itself commentary and all of the actions from earlier brokers . The auto-regressive factorization can characterize any joint coverage in a centralized MDP. The solely modification to every agent’s coverage is the enter dimension, which is barely enlarged by together with earlier actions; and the output dimension of every agent’s coverage stays unchanged.

With such a minimal parameterization overhead, AR coverage considerably improves the illustration energy of PG strategies. We comment that PG with AR coverage (PG-AR) can concurrently characterize all optimum coverage modes within the permutation recreation.

Determine: the heatmaps of actions for insurance policies realized by PG-Ind (left) and PG-AR (center), and the heatmap for rewards (proper); whereas PG-Ind solely converge to a selected mode within the 4-player permutation recreation, PG-AR efficiently discovers all of the optimum modes.

In additional advanced environments, together with SMAC and GRF, PG-AR can be taught attention-grabbing emergent behaviors that require sturdy intra-agent coordination which will by no means be realized by PG-Ind.

Determine 6: (high) emergent conduct induced by PG-AR in SMAC and GRF. On the 2m_vs_1z map of SMAC, the marines maintain standing and assault alternately whereas making certain there is just one attacking marine at every timestep; (backside) within the academy_3_vs_1_with_keeper situation of GRF, brokers be taught a “Tiki-Taka” type conduct: every participant retains passing the ball to their teammates.

Discussions and Takeaways

On this publish, we offer a concrete evaluation of VD and PG strategies in cooperative MARL. First, we reveal the limitation on the expressiveness of well-liked VD strategies, exhibiting that they may not characterize optimum insurance policies even in a easy permutation recreation. Against this, we present that PG strategies are provably extra expressive. We empirically confirm the expressiveness benefit of PG on well-liked MARL testbeds, together with SMAC, GRF, and Hanabi Problem. We hope the insights from this work may gain advantage the group in the direction of extra basic and extra highly effective cooperative MARL algorithms sooner or later.

This publish is predicated on our paper in joint with Zelai Xu: Revisiting Some Frequent Practices in Cooperative Multi-Agent Reinforcement Studying (paper, web site).