N EVER
R EVISIT : C ONTINUOUS E XPLORATION IN
M ULTI -A GENT R
EINFORCEMENT
L EARNING
Anonymous authors
Paper under double-blind review
A BSTRACT
Recently, intrinsic motivations are wildly used for exploration in multi-agent reinforcement learning.
We discover that coming with intrinsic rewards is the issue of revisitation – the relative values of intrinsic rewards, estimated based on neural networks, fluctuate during learning, causing failures of rediscovering promising areas after detachment of exploration.
Consequently, agents risk exploring some sub-spaces repeatedly and being stacked nearing the fixed initial point.
In this paper, we formally define the concept of revisitation, based on which we propose an observation-distribution matching approach to detect the appearance of revisitation.
To avoid it, we add branches to agents’ local Q-networks and the mixing network to separate sub-spaces that have already been revisited for sufficient policy representation capacity.
Furthermore, we use historical samples of joint observation to adjust intrinsic rewards to reduce the probability of and penalize the occurrence of revisitation.
By virtue of these advances, our method achieves superior performance on three challenging Google Research Football (GRF) scenarios and three
StarCraft II micromanagement (SMAC) maps with sparse rewards.
[Figure]
I NTRODUCTION
Multi-agent cooperation is ubiquitous in real-world problems, such as sensor networks (Zhang &
Lesser, 2013) and traffic light control (Zhang et al., 2019).
To introduce intelligence into multiagent systems and achieve sophisticated cooperative behavior, multi-agent reinforcement learning (MARL) has been gaining increasing interest in recent years.
Advanced MARL methods have largely pushed forward the performance of machine learning algorithms on tasks such as StarCraft II micromanagement (Rashid et al., 2018;
Wang et al., 2021b), Hanabi (Bard et al., 2020;
Foerster et al., 2019), and robotic control (Kurin et al., 2020).
Despite these achievements, a problem persists and prevents MARL from extending successfully to more complex problems.
The action-observation space grows exponentially with the number of agents, and the efficiency of exploration strategies in such search spaces largely limits the learning efficiency of MARL algorithms.
Basic exploration (Wang et al., 2020b) schemes, like ϵ -greedy, adopted by many previous works (Wang et al., 2021a; Yu et al., 2021; de Witt et al., 2020) appear to struggle even in tasks with a moderate number of agents.
For example, in a 6 × 12 maze game with two agents (Fig. 4 (b)), QMIX (Rashid et al., 2018) using independent search can only cover less than 20% of the joint observation space (Fig. 1 left) and struggles to find any rewards.
Various intrinsic motivations are introduced into MARL algorithms to enhance their exploration ability by encouraging interaction among agents (Wang et al., 2020b), maximizing a measurements of behavioral randomness (Houthooft et al., 2016; Mahajan et al., 2019; Gupta et al., 2021), and spurring individuality (Jiang & Lu, 2021) and diversity (Li et al., 2021).
These methods significantly enlarge the sub-space that can be explored.
For example, the coverage rate increases from ∼ 20% to ∼ 80% using the CDS (Li et al., 2021) diversity-encouragement incentives (Fig.
1 middle).
However, in this paper, we find that coming with the augmented exploration is a revisitation problem that severely hurts the expected exploration ability and prevents learning efficiently.
Revisitation refers to the situation where, with an enlarged exploration space, agents forget the areas they have visited before after the detachment of exploration, causing them to return and re-explore.
In this way, agents are stacked nearing the fixed initial point and can not explore continuously.
Meanwhile, revisitation in some sub-spaces can repeatedly happen, making this issue more detrimental.
For example, in Fig.
1 (middle), we present the empirical joint observation distribution induced by CDS (Li et al., 2021)
policies at different training time steps.
It can be observed that similar distributions occur periodically during learning, and the algorithm wastes most training samples on unvalued, revisited experiences.
In this paper, we give a formal definition for revisitation in multi-agent settings, based on which we propose a framework for solving this issue.
Intuitively, we consider revisitation occurs because of (1) insufficient policy representation capacity causing forgetting and (2) ineffective intrinsic motivations after the detachment (Ecoffet et al., 2019) of exploration.
To handle the first problem, we add branches to agents’ local Q-networks and the mixing network when revisitation occurs to achieve a dynamically growing neural network structure.
To handle the second problem, we use historical samples of joint observations to adjust intrinsic rewards.
Taking benefit of our correction mechanism, we can prevent revisitation from occurring to avoid an excessive number of branches in the network.
Meanwhile, for each revisitation, we further introduce a KL divergence to penalize it to happen again.
Based on the above merits for detecting and preventing revisitation, our approach NRT ( N ever R evisi t ) achieves nearly 100% coverage rate on the maze task (Fig. 1 right).
Furthermore, we benchmark our approach on both Google Research Football (GRF, Kurach et al.
and SMAC (Samvelyan et al., 2019) in the sparse reward setting, and find that NRT significantly pushes forward state of the art.
Ablation studies show that adding branches is the most important component in revisitation avoidance and performance improvement for challenging tasks.
At the same time, the proposed intrinsic reward adjustment modules are critical in achieving continuous exploration.
B ACKGROUND
In this paper, we formulate multi-agent coordination tasks as Dec-POMDP Oliehoek et al.
(2016), which can be defined as a tuple G = ⟨
I, S, A, P, R, O, n, γ ⟩ , where I is the set of agents, S is the state space,
A is the action space, P is the transition function, R is the reward function, O is the observation space, n is the number of agents, and γ ∈ [0 , 1) is the discount factor.
During sampling, each agent i ∈ I observes its unique information o i and selects an action a i ∈
A independently.
According to the joint action a and environment transition function P ( s ′ | s, a ) , the environment transfers to a new state s ′ and provides a reward that is shared across all agents.
2. C ENTRALIZED T RAINING WITH D ECENTRALIZED E XECUTION
Our approach follows a recently advanced multi-agent optimization framework of centralized training with decentralized execution (CTDE) Lowe et al.
; Foerster et al.
; Sunehag et al.
Rashid et al.
In this framework, each agent executes only based on its local action-observation history.
This distributed decision-making tackles the exponentially growing joint action space.
For stable optimization, agents are trained in a centralized manner with access to global information to achieve reasonable credit assignment across agents.
The individual-global-max (IGM) principle Son et al.
(2019) further guarantees the consistency between the local and global Q-function based on value factorization.
With the above advantages, some algorithms Son et al.
Wang et al.
(2021a)
; Ma et al.
(2021) have achieved remarkable progress in challenging MARL cooperation tasks.
2. CDS
Although the CTDE framework has been proven to accelerate training with value factorization, it still has to face a giant search space.
Diversity in exploration is required for sophisticated cooperation.
Li et al.
(2021) introduced CDS, which achieves diversity when necessary via shared experiences.
Some of the most salient novelties are: (1) Introduce an intrinsic reward function as shown in Eq.based on I π ( τ T ; id ) to encourage specialty of individual trajectories.
(2) Provide an independent
Q-network for each agent to estimate local Q-value after combining with one shared Q-network.
Add an L1 regularization on independent Q-values to encourage sharing crucial knowledge while keeping enough policy representation capacity of necessary diversity.
[Equation]
[Equation]
where id is the identity of each agent, β , β 1 and β 2 are hyper-parameters introduced in CDS, and τ T
=
( o 0 , a 0 , o 1 , . . .
, o T ) is the variable of one agent’s trajectory.
In this paper, we use r I CDS as an example to expose and solve one crucial potential problem of existing intrinsic motivation methods, revisitation as shown in Fig.
1 (middle).
M ETHOD 3. R EVISITATION D ETECTION
We first define the concept of revisitation in multi-agent settings.
Our definition is based on the empirical joint observation distribution induced by the joint policy π :
ρ π ( o ) =
E π [ 1 T (cid:80) Tt =0
o t = o ] .
Intuitively, when ρ π ( o ) changes significantly, the agent team starts to explore a new sub-space.
Still, if, after a significant change, ρ π ( o ) degenerates to a distribution that has occurred before, revisitation happens.
Formally, we have the following definition:
Definition 1.
A δ -revisitation occurs at time step t if there exists a time step t ′′ <
t
so that
[Equation]
Here, D JS is the Jensen-Shannon distance between two distributions.
The first condition describes the ability of many multi-agent exploration algorithms.
As the learning progresses, agents are encouraged to explore new sub-spaces, leading to a shift in the empirical joint observation distribution.
The second condition depicts the occurrence of revisitation.
After exploring a new sub-space for a while, the agents may forget previously learned knowledge, possibly due to limited network representative capacity, and start to re-explore previously visited sub-spaces.
Under discrete observation space, we can estimate ρ π ( o ) with the Monte Carlo (MC) method.
However, in continuous observation space, it is intractable to use MC.
In practice, we estimate the joint observation distribution ρ π ( o ) using an a variational auto-encoder parameterized by ξ , by minimizing the evidence lower bound:
[Equation]
where z is a latent variable to reconstruct o , and p ξ ( o )
=
[Equation]
p
[Equation]
p ξ ( o | z i ) for z
i ∼ p
( z ) , where p ( z ) is a prior of the latent variable vector, which is modeled by a standard
Gaussian distribution N ( z | 0 , I ) and L is fixed as 32 in this paper.
During training, for every 100k time step, we store the current joint observation distribution estimator p ξ t into a buffer, and check for each previous version p ξ t ′′ whether they satisfy the two conditions listed in Definition 1.
If the conditions are satisfied, we call ( t ′′ , t ′ , t ) a revisitation tuple and store ( ρ π t ′′ ( o ) , ρ π t ′ ( o ) , ρ π t ( o )) with ( ρ π t ′′ ( o i ) , ρ π t ′
( o i ) , ρ π t ( o i )) for each agent i ∈
I , where ρ π ( o i ) =
E π (cid:104) 1 T (cid:80) Tt =
1 o i,t
= o i (cid:105) is estimated along with ρ π ( o ) .
3. A UGMENTATION OF THE T RAINING F RAMEWORK
[Figure]
To achieve sufficient policy representation capacity for handling revisitation while benefiting from parameter sharing, we dynamically augment branches of partial neural network structure as shown in Fig.
In this paper, we follow the CTDE framework as discussed in Sec.
2.1 with a mixing network as QMIX (Rashid et al., 2018), whose weights are produced by separate hyper networks with an input of state and are followed by an absolute activation function to ensure the IGM principle.
Starting from the beginning of training, we maintain a default mixing network branch and local-Q branch.
After one detection of revisitation, we will create an augmented mixing network branch and an augmented local-Q branch, which are initialized with the latest default branch to forbid sudden performance breakdown.
Details of branches are introduced in Sec.
B.
Along with our dynamic augmentation structure is a question about how to switch different branches during sampling and training when joint observation o is encountered.
Formally, for each augmented branch, the associated joint observation set is defined based on each revisitation tuple ( t ′′ , t ′ , t ) introduced in Sec.
3.1 and the definition of its detection.
[Equation]
However, during decentralized execution, one agent can only obtain its own observation.
Thus, we introduce the marginal condition based on Eq.
3 to guide each agent to select local-Q branches for both sampling and training.
[Equation]
There are two questions coming with Eq. 4, (1) how to switch augmented local-Q branches when o i belongs to several sets simultaneously, and (2) how to switch augmented mixing network branches when agents switch various local-Q branches at one time step.
As for question (1), we will check according to the created order and activate the earliest branch.
As for question (2), each augmented mixing network branch will be activated only when more than half of agents choose the corresponding augmented local-Q branch.
Our neural networks will switch to the default branch if none of augmented branches is activated or created.
Because the whole trajectory is spliced from different branches, we expect credit assignments across agents (achieved by the mixing network) to not differ too much for stability.
Thus we add an L1 regularization to mixing network branches to encourage them to work only when necessary.
3. A UXILIARY S UPPORTING I NCENTIVES
[Figure]
MLP
GRU
MLP MLP
Agent ( / ( (! () ,& () ) 检测到 0 ) 属于被 遗忘过的状态，使用专属
MLP 做决策 / !
" (! () ,& () ) 1 ! 0 ) 1 + 0 )
+
Relu Relu 针对每一个类，附加专属的额外 modules 计算 Q_tot / ),)
[Figure]
A possible shortcoming of the methods introduced above is that when revisitation occurs frequently, there may be too many branches.
To prevent the number of branches from increasing quickly and adjust intrinsic rewards for handling the detachment of exploration, we design adjustment modules
To prevent revisitation caused by the detachment of intrinsic motivations, we adjust intrinsic rewards with historical samples of joint observations.
In this paper, we periodically store joint observation sequences (every ten episodes) in an independent buffer without deletion.
During training, for time efficiency, we form a compact sub-sampling buffer with 10 trajectories from the whole learning period and 5 trajectories from each revisitation’s historical point.
As inspired by Badia et al.
(2020), based on the K-nearest approach, we calculate the weight of intrinsic rewards: α =
[Equation]
where N k ( o ) is the k nearest neighbors of o in the compact buffer, and ϵ is a small constant (0.001) for numeric stability.
The kernel function K ( · , · ) is defined as K ( x, y ) =
ϵ d 2 ( x,y )+ ϵ , where d is the
Euclidean distance.
For penalizing revisitation, we further introduce r p = (cid:80) ( t ′′ ,t ′ ,
[Equation]
) ∈ R
[Equation]
(cid:0) p
[Equation]
( o ) ∥
p π ( o ) (cid:1) , where p π is the current joint policy.
Overall, the intrinsic reward used in our paper is
[Equation]
(5) where ¯ α = α − µ e σ e is the running average of α , clip means we clip the running average so that it is in the range [ L 1 , L 2 ] , r I CDS is the intrinsic reward introduced by CDS (Li et al., 2021) as shown in Eq. 1, and β p is a hyper-parameter tuning the weight of r p , which is fixed as 0.001 in our experiments.
D IDACTIC E XAMPLE
In this section, we present a maze task (shown in Fig.
5 (b))
to demonstrate the existence of revisitation, its influence on exploration, and how our approach improves learning performance by
[Figure]
avoiding revisitation.
In this task, two agents are initialized at the blue point and are expected to simultaneously reach two red points located in different corners of a 6 × 12 maze within 50 steps.
Each agent can observe its own and teammate’s coordinates.
The action set of both agents includes one-step movement in four directions and an idle action for doing nothing.
Only when agents reach two red points simultaneously, the episode will terminate immediately with a team reward of 100.
For any other cases, reward is set to 0.
[Figure]
Fig.
4 shows the comparison of our approach against baseline algorithms, including stateof-the-art value function factorization learning methods (QMIX (Rashid et al., 2018) and
QPLEX (Wang et al., 2021a)) and multi-agent exploration algorithms (CDS (Li et al., 2021) and MAVEN (Mahajan et al., 2019)).
Experimental results demonstrate the advantage of our approach in exploration, as NRT is the only algorithm that obtains the episode reward of 100.We further provide visitation heat maps of NRT and
CDS within three periods (0 ∼ 0.5M, 0.5M ∼ 1.0M, and 1.0M ∼ 1.5M).
NRT continuously encourage agents to explore further, while agents trained by CDS are stacked nearing the fixed initial points and waste most training samples on revisited experiences after the detachment of previous exploration.
In Fig.
5 (a), we further show another perspective of the 3D plot of JS distance plot to demonstrate continuous exploration achieved by our approach after detecting revisitation.
The circle in Fig.
5 (a) highlights a time step when a revisitation is detected.
At this time, our approach (1) adds a new branch as described in Sec. 3.2; (2) ensures that the joint observations where the revisitation happens are sampled when calculating the intrinsic reward; and (3) adds punishment for revisitation.
In this way, our approach effectively prevents the reappearance of revisitation, leading to continuous exploration.
E XPERIMENT
In Sec. 4, we introduce a toy maze environment to illustrate our approach’s efficiency of exploration while showing the significant harm of repeat revisitation learned by current advanced multi-agent algorithms.
In this section, we will compare our approach against baselines on Google Research
Football (GRF) Kurach et al.
(2020) and SMAC (Samvelyan et al., 2019) in the sparse reward setting, which are currently the most challenging benchmarks for testing cooperation between agents.
We show the median and variance of every evaluation’s average performance of our approach, baselines, and ablations tested with three random seeds (seed=0,1,2).
5. GRF
The GRF benchmark provides numerous scenarios varying in agent numbers and difficulty.
In each scenario, algorithms typically control agents on the left side and play against the built-in AI.
In this paper, we use three representative scenarios to demonstrate the significance of considering revisitation.
Agents’ initial locations for each scenario are shown in Appendix.
Following the convention of
Kurach et al.
(2020) and Li et al.
(2021), the state and each agent’s observation are based on the official simple 115 representation vector, while observations are established according to relative positions.
Each agent has a discrete action space of 19 dimensions, including moving and several basic actions, such as passing and shooting.
Environmental rewards are only provided at the end of one episode.
Agents will get +100 if they score, else get −
[Figure]
setting, the weight is 0.6, while it is 0.9 in the stochastic counterpart.
Fig.
6 demonstrates the comparison between our approach with baseline algorithms in the deterministic and stochastic settings.
Here we first analyze experiment results in the deterministic setting.
In Academy 3 vs 1 with Keeper , QPLEX can achieve similar learning efficiency with our approach, while CDS and QMIX can also achieve a 100 % winning rate.
However, in more complex scenarios, Academy Counterattack Hard in particular, the outperformance of our approach is obvious, showing the advantages of considering revisitation.
In Academy 3 vs 1 with Keeper and
Academy Counterattack Easy , CDS performs similar with QMIX.
With our additional supporting incentives based on Q-function restoration, NRT achieves more efficient exploration.
Like the deterministic counterpart, our approach maintains its outperformance in the stochastic setting, as shown in Fig.
Because opposing players’ behavior might differ across various random environment seeds, the average winning rates during evaluation are nearly impossible to be 100 % .
In this case, our approach still shows clear superiority in all three scenarios.
In challenging scenarios, such as Academy Counterattack Easy , CDS outperforms QMIX.
Following the guidance of our life-long novelty guarantee module, the performance is further raised in all three scenarios.
Experiment results illustrate that our approach can tune intrinsic motivations to lead them to more sophisticated policies in complex tasks.
Ablation Study To understand contribution of each component in the proposed NRT framework, we conduct three ablations: (1) ablate augmented branches, (2) ablate auxiliary dynamic weight of intrinsic motivations, and (3) ablate auxiliary KL punishment after the detection of revisitation.
We respectively name them as NRT-ab-new-branch, NRT-ab-alpha, and NRT-ab-KL.
[Figure]
We compare NRT with its ablations on three representative tasks: Academy Counterattack Easy under the deterministic setting and Academy Counterattack Hard under both the deterministic and stochastic environment, as shown in Fig.
As for NRT-ab-new-branch, we notice an interesting phenomenon.
In Academy Counterattack Easy , NRT-ab-new-branch performs similarly with
NRT.
However, in Academy Counterattack Hard under the deterministic setting, a more complex task, the performance of NRT-ab-new-branch is worse than NRT but still can win sometimes.
In
Academy Counterattack Hard under the stochastic setting, the most challenging task, the median winning rate of NRT-ab-new-branch during evaluation is almost zero.
This phenomenon reveals the importance of constructing dynamically augmentation of neural network structure according to the degree of exploration in complex environments.
The performance of NRT-ab-alpha and NRT-ab-KL in three tasks illustrate that the combined effect of our auxiliary supporting incentives makes our approach outperform vanilla CDS.
5. SMAC
In this section, we test our approach on SMAC, consisting of various maps with different agent numbers and various agent types.
Previous work has achieved remarkable performance in many challenging tasks.
However, their success heavily relays on dense rewards provided by the environment, which includes changes in the blood volume of our agents and opposing agents.
In this paper, we consider SMAC tasks in the sparse reward setting.
Agents will only receive rewards at the end of one episode.
Agents will get +100 if they win, else get -1, which maintains the same as that in GRF.
[Figure]
Fig.
8 demonstrates the comparison between our approach with baseline algorithms in three easy
SMAC maps with sparse reward.
QMIX achieves good performance with dense rewards (Rashid et al., 2018).
However, vanilla QMIX can not learn any strategies to win in all three easy maps based on sparse rewards as shown in Fig. 8.
Using QMIX as the mixing network, CDS can learn valuable strategies in 3m with its intrinsic motivations as discussed in Sec. 2.2.
However, CDS still learns nothing to win in 2m vs 1z .
Our approach, adjusting intrinsic rewards of CDS based on the detection of revisitation, outperforms CDS in all three maps.
The comparison between NRT and CDS supports our above discussion about one potential drawback of current intrinsic motivation methods, revisitation, which seriously influences exploration efficiency.
QPLEX achieves good performance in
3m with its duplex dueling network architecture, but still learns nothing to win in other two maps.
MAVEN achieves remarkable performance in 2m vs 1z , but performs similar with QMIX in other two maps.
Compared with QPLEX and MAVEN, NRT can adapt to all three maps, showing its exploration efficiency.
R ELATED W ORK
Exploration Bonuses.
Exploration is one key factor that determines the efficiency of deep reinforcement learning (Houthooft et al., 2016;
Trott et al., 2019; Raileanu & Rockt¨aschel, 2020; Zintgraf et al., 2021; Chen et al., 2021).
Starting from the classic ϵ -greedy action selector, numerous advanced algorithms are proposed to enhance the efficiency of exploration.
Count-based exploration methods directly use visit counts to guide an agent’s behavior towards reducing uncertainty (Strehl & Littman, 2008;
Bellemare et al., 2016; Martin et al., 2017; Ostrovski et al., 2017;
Tang et al., 2017; Machado et al., 2020).
A representative method is Random Network Distillation (RND), using prediction errors to estimate count-based rewards (Burda et al., 2018b; Osband et al., 2018; 2019; Ciosek et al., 2019).
The prediction errors are also used in Pathak et al.
; Burda et al.
(2018a)
; Pathak et al.
Dean et al.
(2020) to achieve self-organized intrinsic motivations.
Exploration in the Multi-Agent Setting.
Exploration is more crucial in the multi-agent setting, because the search space grows exponentially with the number of agents.
Besides exploring the environment, we also need to consider diversity across agents to achieve sophisticated coordination.
In the multi-agent setting, agents’ exploration can be jointly encouraged (Mahajan et al., 2019; Gupta et al., 2021; Zheng et al., 2021; Liu et al., 2021), encouraged in pairs (Wang et al., 2020b; Ndousse et al., 2021), or independently encouraged for being special from the whole group (Jiang & Lu, 2021;
Li et al., 2021).
Exploration can also be encouraged through the factorization of roles (Wang et al., 2020a; 2021b).
In this paper, we choose CDS (Li et al., 2021) as the intrinsic motivation for exploration because it is the current state-of-the-art algorithm in many challenging benchmarks.
Forgetting.
Revisitation discussed in our paper also relates to the forgetting of previous policies, which is wildly discussed in lifelong learning with the multi-task setting (Rebuffi et al., 2017;
Li &
Hoiem, 2017; Rolnick et al., 2019; Von Oswald et al., 2019).
Some advanced algorithms have studied this topic by extending the supervised regularization (Kirkpatrick et al., 2017) or replay (Isele &
Cosgun, 2018; Yan et al., 2022) paradigms, exacerbating the stability-plasticity tension.
Others, on the other hand, have proposed multi-stage processes in which the agent first applies existing knowledge to the current task and then incorporates newly acquired knowledge into a shared repository (Schwarz et al., 2018; Mendez et al., 2020).
However, forgetting is rarely discussed in single-task and multiagent reinforcement learning, which also has the possibility of forgetting during exploration.
The key question is how to detect and forbid it automatically without any information about the stages agents are in during learning.
In this paper, we attempt to answer this question to enhance exploration efficiency.
Ecoffet et al.
(2019) and Ecoffet et al.
(2021) intuitively show a hypothetical example of revisitation caused by detachment in intrinsic motivations.
They solve it by storing all visited states and related policies to access.
Before sampling, they will first check which state to return from the whole state space, which is challenging to execute in a large continuous search space, especially in multi-agent settings.
In this paper, we empirically show policies’ repeated revisitation in the multi-agent setting and solve it based on much fewer memories.
Our approach maintains active detection and prevention of revisitation.
We hope this paper can stimulate a rethinking of intrinsic motivations for more effective exploration in single-task multi-agent learning.
C LOSING R EMARKS
In this paper, we investigate the intrinsic motivation methods for multi-agent exploration, and find the revisitation issue that prevents these methods from achieving efficient exploration in complex tasks based on sparse rewards.
For future work, we plan to study the interplay between the number of augmented branches and the scale of the proposed intrinsic rewards.
We hope our work can encourage more studying on the limitation of current exploration methods based on intrinsic motivations to push forward the boundary of artificial intelligence.
A E XPERIMENT S ETTING
The visualization of the initial position of each agent is shown in Fig.
The difficulty of scenarios increases from Academy 3 vs 1 with Keeper to Academy Counterattack Hard based on a noticeable difference between the number of agents and the initial distance of each agent to the goal and opposing players.
[Figure]
B A RCHITECTURE AND H YPER - PARAMETERS
In this paper, we use simple network structures for the local Q-networks and the mixing networks as baselines.
Agents use a partially shared module to represent local Q-functions as CDS (Li et al., 2021).
Following the setting of CDS, agents share a trajectory encoding network made up of two layers: a fully connected layer followed by a GRU layer with a 64-dimensional hidden state for individual
Q-functions.
Following the trajectory encoding network, all agents share a one-layer Q network, with each agent having its own Q network with the same structure as the shared Q network.
To estimate the global action values, we use QMIX-style mixing networks, which include two 32-dimensional hidden layers activated by ReLU.
Hypernetworks condition on global states to generate mixing network parameters.
These options apply to QMIX Rashid et al.
(2018) as well.
All experiments are optimized using RMSprop with a learning rate of 5 × 10 − 4 , γ of 0.99, and no momentum or weight decay.
We use ϵ -greedy with ϵ anneals linearly from 1.0 to 0.05 over 50K time steps and keep constant for the rest of the training while selecting actions.
We will evaluate the latest policies 32 times every 10k steps to calculate the average winning rate.
For our approach, all baselines and ablations, we introduce a prioritized replay buffer with the same α of 0.3 and use
TD(0.8) while calculating target values.
The intrinsic motivation introduced in CDS includes three hyper-parameters: β , β 1 , and β 2 , with another hyper-parameter λ controls the weight of L1 regularization on independent local Q-networks.
In this paper, we roughly fine-tune these hyper-parameters while ensuring CDS uses the same hyperparameters during comparison.
For the maze game, we use { β, β 1 , β 2 λ } as { 0 . 15 , 0 . 5 , 0 . 5 , 0 . 01 } .
For all GRF scenarios, we use { β, β 1 , β 2 , λ } as { 0 . 05 , 0 . 5 , 1 . 0 , 0 . 1 } , which is the same as the original
CDS setting in GRF environments.
In our approach, we introduce several special hyper-parameters and some basic settings to establish our framework.
δ in Definition 1 is fixed as 4 in all experiments.
η in Eq.
3 is fixed to 1 in all experiments.
To reduce the size of the replay buffer loading trajectories to calculate α , we will save trajectories every ten times.
The weight of L1 normalization on independent mixing networks is fixed to 0.1 in all experiments.
{ L 1 , L 2 , β p } is set to { 0 . 5 , 2 . 0 , 10 − 3 } for the maze game.
For all GRF scenarios, β p is set to 0.001.
{ L 1 , L 2 } is set to { 0 . 5 , 2 . 0 } for the scenario Academy Counterattack Easy based on both stochastic and deterministic environment setting.
Meanwhile, { L 1 , L 2 } is set to { 1 . 0 , 2 . 0 } for other scenarios.
For all SMAC maps, { L 1 , L 2 , β p } is set to { 1 . 0 , 4 . 0 , 10 − 3 } .
We use the codes provided by the authors for all baseline algorithms.
B. S UPPLEMENTARY I NTERPRETATION OF NRT’ S D YNAMICALLY A UGMENTED N EURAL N ETWORK S TRUCTURE
In this paper, at the beginning of learning, when no revisitation is detected, we maintain local
Q-networks as CDS (Li et al., 2021) with a QMIX-style mixing network to estimate Q tot .
Based on each revisitation, we separate the whole joint observation space into sub-spaces with
Eq. 3.
In this section, for convenience, we use sub-space to represent sub- joint observation space which is dynamically separated along with the detection of revisitaion.
To provide sufficient policy representation capacity, we dynamically augment the neural network structure for each sub-space as shown in Fig. 2.
The last layers of agents’ local Q-networks are independent across sub-spaces, while the previous layers are shared for benefits in learning efficiency from parameter sharing.
Here we name the augmented last layer of agents’ local Q-networks as the augmented local-Q branch activated in the sub-space of related revisitation.
The original last layer of agents’ local Q-networks initialized at the beginning of learning is named as default local-Q branch activated when no revisitation is detected or in the sub-space related to no revisitation.
For achieving sufficient representational capacity of the mixing network, we augment it along with augmentations of local Q-networks as shown in Fig.
The original QMIX (Rashid et al., 2018) calculates Q tot with:
[Equation]
6) where Q i is the local Q-value of agent i ∈
I , W 1 is a n × m matrix, b 1 and W 2 are vectors with m dimensions, b 2 is a variable with 1 dimension.
W 1 and W 2 are both with non-negative values.
W 1 ,
W 2 , b 1 , and b 2 are all outputs of several hypernetworks with the state as input.
However, the shared mixing network might not have enough capacity while the number of local-Q branches increasing.
Thus we further expand the mixing network.
Our QMIX-style mixing network is
[Equation]
where W B is a vector with m dimensions and b B is a variable with 1 dimension.
Q Stot is shared among sub-spaces.
Q Itot is an individual part of each sub-space’s mixing network.
Here we name the augmented W B and b B related to each revisitation as the augmented mixing network branch .
The original W B and b B initialized at the beginning of learning is named as default mixing network branch activated when no revisitation is detected or the sub-space related to no revisitation.
In its current form, the mixing network relays on Q Stot or Q Itot arbitrarily.
On the contrary, we expect credit assignments across agents (achieved by the mixing network) to not differ too much between sub-spaces for stability.
Thus we add an L1 regularization to mixing network branches to encourage them to work only when necessary.
The original QMIX (Rashid et al., 2018) train Q tot with
[Equation]
) where y tot = r + γ max u ′ Q tot ( τ ′ , u ′ , s ′ ; θ − ) , θ − are the parameters of a target network as in DQN, and b is the batch size of transitions sampled from the replaybuffer.
In this paper, we train Q tot with
L ( θ ) =
b (cid:88)
i =
(cid:104)(cid:0) y toti − Q tot ( τ , u , s ; θ ) (cid:1) 2 (cid:105) + b (cid:88)
i =
||
Q
I, − tot || 1 , (9) where Q I, − tot = ( stop grad ([ Q 1 , ..., Q n ] W 1 + b 1 ))
W TB + b B .
We stop gradient back-propagation of the mixing network’s shared parts in the addition normalization loss.
Thus we can only regularize our mixing network’s individual parts related to each sub-space.
During decentralized execution, one agent can only obtain its local observation.
Thus, we introduce the marginal condition Eq. 4 based on Eq.
3 to guide each agent to select local-Q branches for sampling.
To maintain consistency between sampling and training, Eq. 4 is also used to select each agent’s local Q-network branches while training.
Each augmented mixing network branch will be activated only when more than half of agents choose the corresponding augmented local-Q branch.
Otherwise, the default mixing network branch is switched.
C E XPERIMENTAL D ETAILS
[Figure]
We further show JS distances calculated during training in Academy Counterattack Hard under the deterministic setting as a representative of GRF environments.
The definition of the x-y axis is the same as that introduced in Sec. 4.
Similar to our toy maze environment, JS distances between historical points and checkpoints periodically fluctuate under the training of QMIX and CDS, as shown in Fig.
10 left and middle.
Meanwhile, under our approach’s guidance of preventing revisitation, policies learned in complex environments achieve stable improvement, as shown in Fig.
10 right.
Taking advantage from stable improved exploration, our approach achieves outstanding performance in challenging GRF scenarios.
[Figure]
[Equation]
[Figure]
QMIX
CDS
NRT (ours)
[Figure]
We demonstrate the 2D-Color Plot of Fig.as shown in Fig.
11 for readers to follow our work’s motivations easier.
During learning, we will store the joint observation distribution induced by the joint policy π every 100k time steps, named historical point time (the y-axis in Fig. 11).
Meanwhile, for every 100k time step, we will calculate the JS distance between the current distribution and all historical points, named checkpoint time (the x-axis in Fig. 11).
Half of each picture in Fig.
11 is printed in the same color.
That is because checkpoint time is always larger than historical times while calculating the JS distances.
For each historical point, it is compared with checkpoints after it every 100k time steps.
In Fig.
11 right, most JS distances are large and stable until coverage to the optimal strategy, after our approach detects and solves revisitation at the early period of learning.
In Fig.
12, we show and enlarge a part of Fig.
11 right to demonstrate our approach’s learning progress before coverage clearly.
Through the whole learning period, revisitation means that the exploration achieved at one learning period is actually driving the joint policy to be similar to some historical policies.
For example, in Fig.
12, if we choose the joint observation distribution counted at 300k time-step as the historical point, checkpoints at 400k and 500k time-step indicate that intrinsic motivations are driving agents to explore the environment.
However, if we choose the joint observation distribution counted at 100k time-step as the historical point, checkpoints at 400k and 500k time-step indicate that intrinsic motivations are driving agents to re-explore the sub-space that has been explored at 100k time-step.
In this paper, we call this phenomenon revisitation and attempt to solve it with (1) augmented neural networks for sufficient policy representation capacity, (2) adjusted intrinsic motivation weight according to joint observation novelty compared with each revisitation historical point, and (3) further punishment of revisitation based on KL divergence.
Based on these novelties, our approach forbids revisitation to occur again and achieves the optimal strategy in the maze exploration task by driving agents to explore away from both 100k time-step and 300k time-step, indicating reliable exploration efficiency.
As for baselines such as QMIX (explores with ϵ -greedy) and CDS (explores with intrinsic motivations), revisitation occurs periodically, which heavily influences exploration efficiency and causes agents to be stacked nearing the fixed initial points as shown in Fig.
C. W ILL THE S IZE OF R EPLAY B UFFER I NFLUENCE R EVISITAION ?
[Figure]
Coming up with the phenomenon of revisitation based on intrinsic motivations is one natural question:
Which role does the replay buffer play in revisitation?
Here we still use CDS as an example of intrinsic motivations and test it in our maze environment.
Fig.
13 demonstrates that the size of replay buffer has trivial influence on revisitaion.
In Fig.
13 left, it seems that revisitation occurs according to the size of the replay buffer.
However, after we multiply the replay buffer’s size from 250k time steps to 500k time steps, the interval of periodical revisitation is similar to that with smaller replay buffer as shown in Fig.
13 right.
Thus, in this paper
[Figure]
we choose to fix our replay buffer’s size as baselines and adjust intrinsic motivations with augmented policy representation capacity
[Figure]
C. E XPERIMENTAL R ESULTS P LOTTED WITH M EANS AND S TANDARD D EVIATIONS
[Figure] [Figure]
We re-plot our experimental results with means and standard deviations as shown in Fig.
14 and
Fig.
The comparison between our algorithm and baseline is consistent with that measured with median performance.
In general, our approach achieves better performance in 5 out of 6 GRF scenarios (slightly better in Academy 3 vs 1 with Keeper based on the stochastic environment) and 2 out of 3 SMAC maps.