The value of curricula has been well established in machine learning, reinforcement learning, and in biological systems. When a desired behaviour is sufficiently complex, or the environment too unforgiving, it can be intractable to learn the behaviour from scratch through random exploration. Instead, by “starting small”(Elman, 1993), an agent can build skills, representations, and a dataset of meaningful experiences that allow it to accelerate its learning. Such curricula can drastically improve sample efficiency (Bengio et al., 2009).
Typically, curriculum learning uses a progression of tasks or environments. Simple tasks that provide meaningful feedback to random agents are used first, and some schedule is used to introduce more challenging tasks later during training (Graves et al., 2017). However, in many contexts neither the agent nor experimenter has such unimpeded control over the environment. In this work, we instead make use of curricula that are internal to the agent, simplifying the exploration problem without changing the environment. In particular, we grow the size of the action space of reinforcement learning agents over the course of training.
At the beginning of training, our agents use a severely restricted action space. This helps guide exploration, and provides low variance updates during learning. The action space is then grown progressively. Eventually, using the most unrestricted action space, the agents are able to find superior policies. Each action space is a strict superset of the more restricted ones. This paradigm requires some domain knowledge to identify a suitable hierarchy of action spaces. However, such a hierarchy is often easy to find. For example, continuous spaces can be discretised with increasing resolution. Similarly, curricula for coping with the large combinatorial action spaces induced by many agents can be obtained from the prior that nearby agents are more likely to need to coordinate.
We propose an approach that uses off-policy reinforcement learning to improve sample efficiency in this type of curriculum learning. Since data from exploration using a restricted action space is still valid in the Markov Decision Processes (MDPs) corresponding to the less restricted action spaces, we can learn value functions in the less restricted action space with ‘off-action-space’ data collected by exploring in the restricted action space. In our approach, we learn value functions corresponding to each level of restriction simultaneously. We can use the relationships of these value functions to each other to accelerate learning further, by using value estimates themselves as initialisations or as bootstrap targets for the less restricted action spaces, as well as sharing learned state representations. In this way, we transfer data, value estimates, and representations for value functions with restricted action spaces to those with less restricted actions spaces.
Empirically, we first demonstrate the efficacy of our approach in two simple control tasks, in which the resolution of discretised actions is progressively increased. We then tackle a more challenging set of problems with combinatorial action spaces, in the context of StarCraft micromanagement with large numbers of agents (50-100). Given the heuristic prior that nearby agents in multiagent setting are likely to need to coordinate, we use hierarchical clustering to impose a restricted action space on the agents. Agents in a cluster are restricted to take the same action, but we progressively increase the number of groups that can act independently of one another over the course of training. Our method substantially improves sample efficiency on a number of tasks, outperforming learning any particular action space from scratch, a number of ablations, and an actor-critic baseline that learns a single value function for the behaviour policy, as in the work ofCzarnecki et al. (2018). Code is available at https://github.com/TorchCraft/TorchCraftAI/tree/gas-micro.
2 Related work
Curriculum learning has a long history, appearing at least as early as the work of Selfridge et al. (1985)
in reinforcement learning, and for the training of neural networks sinceElman (1993).
In supervised learning, one typically has control of the order in which data is presented to the learning algorithm. For learning with deep neural networks,Bengio et al. (2009)Zaremba and Sutskever, 2014; Pentina et al., 2015; Graves et al., 2017) study diagnostics that can be used to automate the choice of task mixtures throughout training. In a self-supervised control setting, Murali et al. (2018) use sensitivity analysis to automatically define a curriculum over action dimensions and prioritise their search space.
In some reinforcement learning settings, it may also be possible to control the environment so as to induce a curriculum. With a resettable simulator, it is possible to use a sequence of progressively more challenging initial states (Asada et al., 1996; Florensa et al., 2017). With a procedurally generated task, it is often possible to automatically tune the difficulty of the environments (Tamar et al., 2016). Similar curricula also appear often in hierarchical reinforcement learning, where skills can be learned in comparatively easy settings and then composed in more complex ways later (Singh, 1992). Taylor et al. (2007) use more general inter-task mappings to transfer -values between tasks that do not share state and action spaces. In adversarial settings, one may also induce a curriculum through self-play (Tesauro, 1995; Sukhbaatar et al., 2017; Silver et al., 2017). In this case, the learning agents themselves define the changing part of the environment.
A less invasive manipulation of the environment involves altering the reward function. Such reward shaping allows learning policies in an easier MDP, which can then be transferred to the more difficult sparse-reward task (Colombetti and Dorigo, 1992; Ng et al., 1999). It is also possible to learn reward shaping on simple tasks and transfer it to harder tasks in a curriculum (Konidaris and Barto, 2006).
In contrast, learning with increasingly complex function approximators does not require any control of the environment. In reinforcement learning, this has often taken the form of adaptively growing the resolution of the state space considered by a piecewise constant discretised approximation (Moore, 1994; Munos and Moore, 2002; Whiteson et al., 2007). Stanley and Miikkulainen (2004) study continual complexification in the context of coevolution, growing the complexity of neural network architectures through the course of training. These works progressively increase the capabilities of the agent, but not with respect to its available actions.
In the context of planning on-line with a model, there are a number of approaches that use progressive widening to consider increasing large action spaces over the course of search (Chaslot et al., 2008), including in planning for continuous action spaces (Couëtoux et al., 2011). However, these methods cannot directly be applied to grow the action space in the model-free setting.
A recent related work tackling our domain is that of Czarnecki et al. (2018), who train mixtures of two policies with an actor-critic approach, learning a single value function for the current mixture of policies. The mixture contains a policy that may be harder to learn but has a higher performance ceiling, such as a policy with a larger action space as we consider in this work. The mixing coefficient is initialised to only support the simpler policy, and adapted via population based training (Jaderberg et al., 2017). In contrast, we simultaneously learn a different value function for each policy, and exploit the properties of the optimal value functions to induce additional structure on our models. We further use these properties to construct a scheme for off-action-space learning which means our approach may be used in an off-policy setting. Empirically, in our settings, we find our approach to perform better and more consistently than an actor-critic algorithm modeled after Czarnecki et al. (2018), although we do not take on the significant additional computational requirements of population based training in any of our experiments.
We formalise our problem as a MDP, specified by a tuple . The set of possible states and actions are given by and , is the transition function that specifies the environment dynamics, and is a discount factor used to specify the discounted return for an episode of length . We wish our agent to maximise this return in expectation by learning a policy that maps states to actions. The state-action value function (-function) is given by . The optimal -function satisfies the Bellman optimality equation:
-learning (Watkins and Dayan, 1992) uses a sample-based approximation of the Bellman optimality operator to iteratively improve an estimate of . -learning is an off-policy method, meaning that samples from any policy may be used to improve the value function estimate. We use this property to engage -learning for off-action-space learning, as described in the next section.
We also introduce some notation for restricted action spaces. In particular, for an MDP with unrestricted action space we define a set of action spaces . Each action space is a subset of the next: . A policy restricted to actions is denoted . The optimal policy in this restricted policy class is , and its corresponding value and action-value functions are and .
Additionally, there is often structure in the problem that creates a natural hierarchy of actions, such that we can identify for every action a parent action in the space of . For example, a discretised continuous action can identify its nearest neighbour in as a parent. Since action spaces are subsets of larger action spaces, for all , i.e., one child of each action is itself.
4 Curriculum learning with growing action spaces
We build our approach to growing action spaces (GAS) on off-policy value-based reinforcement learning.
-learning and its deep-learning adaptations have shown strong performance(Hessel et al., 2018), and admit a simple framework for off-policy learning. In our setting, off-policy learning and reasoning about optimal value functions becomes particularly useful as it enables strategies for efficient transfer of data, value estimates, and representations from restricted to unrestricted action spaces.
4.1 Off-action-space learning
A value function for an action space may be updated with transitions using actions drawn from its own action space, or any more restricted action spaces, as long as we use an off-policy learning algorithm. The restricted transitions simply form a subset of the data required to learn the value functions of the less restricted action spaces. As a result, we may use samples drawn from a behaviour policy based on a value function for low to directly train a higher value function. To exploit this, we simultaneously learn an estimated optimal value function for each action space .
At the beginning of each episode, we sample according to some distribution. The experiences generated in that episode are used to update all of the . This off-action-space learning is a type of off-policy learning that enables efficient exploration by restricting it to the low- regime. We sample at the beginning of the episode rather than at each timestep because, if the agent uses a high- action, it may enter a state that is inaccessible for a lower- policy, and we do not wish to force a low- value function to generalise to states that are only accessible at higher .
Since data from a restricted action space only supports a subset of the state-action space relevant for the value functions of less restricted action spaces, we hope that a suitable function approximator still allows some generalisation to the unexplored parts of the less restricted state-action space.
4.2 Value estimates
This is because each action space is a strict subset of the larger ones, so the agent can always in the worst case fall back to a policy using a more restricted action space.
This monotonicity intuitively recommends an iterative decomposition of the value estimates, in which is estimated as a sum of and some positive . This is not immediately possible due to the mismatch in the support of each function. However, we can leverage a hierarchical structure in the action spaces when present, as described in Section 3. In this case we can use:
This is a task-specific upsampling of the lower- value function to intialise the next value function. Both and are learned components. We could further regularise or restrict the functional form of to ensure its positivity. However, we did not find this to be necessary in our experiments, and simply initialised to be small.
The property (2) also implies a modified Bellman optimality equation:
The are redundant in their role as conditions on the optimal value function . However, the Bellman optimality equation also gives us the form of a -learning update, where the term in the expectation on the RHS is used as an operator that iteratively improves an estimate of . When these estimates are inaccurate, the modified form of the Bellman equation may lead to different updates, allowing the solutions to higher to be bootstrapped from those at lower .
We expect that policies with low are easier to learn, and that therefore the corresponding is more accurate earlier in training. When values are positive, these values could be picked up by the modified bootstrap, and rapidly learned by the higher-
value functions. Empirically however, we find that using this form for the target in our loss function performs no better than just maximising over. We discuss the choice of target and these results in more detail in Section 6.2.
By sharing parameters between the function approximators of each , we can learn a joint state representation, which can then be iteratively decoded into estimates of the value for each action space. This shared embedding can be iteratively refined by, e.g., additional network layers for each to maintain flexibility along with transfer of useful representations. This simple approach has had great success in improving the efficiency of many multi-task solutions using deep learning (Ruder, 2017).
4.4 Curriculum scheduling
It may be difficult to choose a good distribution from which to sample for the behaviour policy, and an appropriate schedule with which to increase its mean during training. Czarnecki et al. (2018) use population based training (Jaderberg et al., 2017) to choose a mixing parameter on the fly. However, this comes at significant computational cost, and optimises greedily for immediate performance gains rather than for optimal learning efficiency. Many other strategies exist for tuning a curriculum automatically, such as those explored by Graves et al. (2017). We use a simple linear schedule on a mixing parameter , picking
with probabilityand with probability . This worked well empirically with little effort to tune. A more sophisticated or automated schedule could be beneficial, at the cost of additional overhead and algorithmic complexity.
5 Growing action spaces for multi-agent control
In cooperative multi-agent control, the full unrestricted action space allows each of agents to take actions from a set , resulting in an exponentially large action space of size . Random exploration in this action space is highly unlikely to produce sensical behaviours, so growing the action space as we propose is particularly valuable in this setting. One approach would be to limit the actions available to each agent, as done in our discretised continuous control experiments (Section 6.1) and those of Czarnecki et al. (2018). However, the joint action space would still be exponential in . We propose instead to use hierarchical clustering, and to assign the same action to nearby agents.
At the first level of the hierarchy, we treat the whole team as a single group, and all agents are constrained to take the same action. At the next level of the hierarchy, we split the agents into groups using an unsupervised clustering algorithm, allowing each group to act independently. At each further level, every group is split once again into smaller groups. In practice, we simply use -means clustering based on the agent’s spatial position, but this can be easily extended to more complex hierarchies using other clustering approaches.
To estimate the value function, we compute a state-value score , and a group-action delta for each group at each level . Then, we compute an estimated group-action value for each group, at each level, using a per-group form of (3): . We use to initialise the iterative computation, similarly to the dueling architecture of Wang et al. (2015). The estimated value of the parent action is the estimated value of the entire parent group all taking the same action as the child group. At each level we now have a set of group-action values.
In effect, a multi-agent value-learning problem still remains at each level , but with a greatly reduced number of agents at low . We could simply use independent -learning (Tan, 1993), but instead choose to estimate the joint-action value at each level as the mean of the group-action values for the groups at that , as in the work of Sunehag et al. (2017). A less restrictive representation, such as that proposed by Rashid et al. (2018), could help, but we leave this direction to future work.
A potential problem is that the clustering changes for every state, which may interfere with generalisation across state-action pairs as group-actions will not have consistent semantics. We address this in two ways. First, we include the clustering as part of the state, and the cluster centroids are re-initialised from the previous timestep for to keep the cluster semantics approximately consistent. Second, we use a functional representation that produces group-action values that are broadly agnostic to the identifier of the group. In particular, we compute a spatially resolved embedding, and pool over the locations occupied by each group. See Figure 2 and Section 6.2 for more details.
We investigate two classes of problems that have a natural hierarchy in the action space. First, simple control problems where a coarse action discretisation can help accelerate exploration, and fine action discretisation allows for a more optimal policy. Second, the cooperative multi-agent setting, discussed in Section 5, using large-scale StarCraft micromanagement scenarios.
6.1 Discretised continuous control
As a proof-of-concept, we look at two simple examples: versions of the classic Acrobot and Mountain Car environments with discretised action spaces. Both tasks have a sparse reward of +1 when the goal is reached, and we make the exploration problem more challenging by terminating episodes with a penalty of -1 if the goal is not reached within 500 timesteps. The normalised remaining time is concatenated to the state so it remains Markovian despite the time limit. There is a further actuation cost of . At , the actions apply a force of and . At each subsequent , each action is split into two children, one that is the same as the parent action, and the other applying half the force. Thus, there are actions in .
The results of our experiments are shown in Figure 1. Training with the lower resolutions and from scratch converges to finding the goal, but incurs significant actuation costs. Training with from scratch almost never finds the goal with -greedy exploration. We also tried decaying the at a quarter of the rate ( slow ) without success. In these cases, the policy converges to the one that minimises actuation costs, never finding the goal. Training with a growing action space explores to find the goal early, and then uses this experience to transition smoothly into a solution that finds the goal but takes a slower route that minimises actuation costs while achieving the objective.
Discretised continuous control with growing action spaces. We report the mean and standard error (over 10 random seeds) of the returns during training, with a moving average over the past 20 episodes.(slow ) is an ablation of that decays at a quarter the rate.
6.2 Combinatorial action spaces: StarCraft battles
6.2.1 Large-scale StarCraft Micromanagement
The real-time strategy game StarCraft and its sequel StarCraft II have emerged as popular platforms for benchmarking reinforcement learning algorithms (Synnaeve et al., 2016; Vinyals et al., 2017). Full game-play has been tackled by e.g. (Lee et al., 2018; Vinyals et al., 2019), while other works focus on sub-problems such as micromanagement, the low-level control of units engaged in a battle between two armies (e.g. (Usunier et al., 2016)). Efforts to approach the former problem have required some subset of human demonstrations, hierarchical methods, and massive compute scale, and so we focus on the latter as a more tractable benchmark for a comparative evaluation of our methods.
Most previous work on RL benchmarking with StarCraft micromanagement is restricted to maximally 20-30 units (Samvelyan et al., 2019; Usunier et al., 2016). In our experiments we focus on much larger-scale micromanagement scenarios with 50-100 units on each side of the battle. To further increase the difficulty of these micromanagement scenarios, in our setting the starting locations of the armies are randomised, and the opponent is controlled by scripted logic that holds its position until any agent-controlled unit is in range, and then focus-fires on the closest enemy. This increases the exploration challenge, as our agents need to learn to find the enemy first, while they hold a strong defensive position. The action space for each unit permits an attack-move or move action in eight cardinal directions, as well as a stop action that causes the unit to passively hold its position.
In our experiments, we use for -means clustering and split down to at most four or eight groups. The maximum number of groups in an experiment with is . Although our approach is designed for off-policy learning, we follow the common practice of using -step -learning to accelerate the propagation of values (Hessel et al., 2018). Our base algorithm uses the objective of -step -learning from the work of Mnih et al. (2016), and collects data from multiple workers into a short queue similarly to Espeholt et al. (2018). Full details can be found in the Appendix.
6.2.2 Model architecture
We propose an architecture to efficiently represent the value functions of the action-space hierarchy. The overall structure is shown in Figure 2. We start with the state of the scenario (1). Ally units are blue and split into two groups. From the state, features are extracted from the units and map (see Appendix for full details). These features are concatenated with a one-hot representation of the unit’s group (for allied agents), and are embedded with a small MLP. A 2-D grid of embeddings is constructed by adding up the unit embeddings for all units in each cell of the grid (2). The embeddings are passed through a residual CNN to produce a final embedding (3), which is copied several times and decoded as follows. First, a state-value branch computes a scalar value by taking a global mean pooling (4) and passing the result through a 2-layer MLP (6). Then, for each , a masked mean-pooling is used to produce an embedding for each group at that by masking out the positions in the spatial embedding where there are no units of that group (5a, 5b, 5c). A single evaluation MLP for each is used to decode this embedding into a group action-score (7a, 7b, 7c). This architecture allows a shared state representation to be efficiently decoded into value-function contributions for groups of any size, at any level of restriction in the action space.
We consider two approaches for combining these outputs. In our default approach, described in Section 5, each group’s action-value is given by the sum of the state-value and group-action-scores for the group and its parents (8a, 8b). In ‘SEP-Q’, each group’s action-value is simply given by the state-value added to the group-action score, i.e., . This is an ablation in which the action-value estimates for restricted action spaces do not initialise the action-value estimates of their child actions.
6.2.3 Results and discussion
Figure 3 presents the results of our method, as well as a number of baselines and ablations, on a variety of micromanagement tasks. Our method is labeled Growing Action Spaces , such that will grow from to . Our primary baselines are policies trained with action spaces or from scratch. consistently outperforms both of these variants. Policies trained from scratch on struggle with exploration, in particular in the harder scenarios where the opponent has a numbers advantage. Policies trained from scratch on learn quickly, but plateau comparatively low, due to the limited ability of a single group to position effectively. benefits from the efficient exploration enabled by an intialisation at , and uses the data gathered under this policy to efficiently transfer to ; enabling a higher asymptotic performance.
We also compare against a Mix&Match (MM) baseline following the actor-critic approach of Czarnecki et al. (2018), but adapted for our new multi-agent setting and supporting a third level in the mixture of policies (, ,
). We tuned hyperparameters for all algorithms on the easiest, fastest-training scenario (80 marines vs. 80 marines). On this scenario, MM learns faster but plateaus at the same level as. MM underperforms on all other scenarios to varying degrees. Learning separate value functions for each
, as in our approach, appears to accelerate the transfer learning in the majority of settings. Another possible explanation is that MM may be more sensitive to hyperparameters. We do not use population based training to tune hyperparameters on the fly, which could otherwise help MM adapt to each scenario. However, GAS would presumably also benefit from population based training, at the cost of further computation and sample efficiency.
The policies learned by GAS exhibit good tactics. Control of separate groups is used to position our army so as to maximise the number of attacking units by forming a wall or a concave that surrounds the enemy, and by coordinating a simultaneous assault. Figure 4 in the Appendix shows some example learned policies. In scenarios where MM fails to learn well, it typically falls into a local minimum of attacking head-on.
In each scenario, we test an ablation GAS (2): ON-AC that does not use our off-action-space update, instead training each level of the -function only with data sampled at that level. This ablation performs slightly, or considerably, worse in each scenario. As expected, it is beneficial to accelerate learning for finer action spaces using data drawn from the off-action-space policy.
We present a number of further ablations on two scenarios. The most striking failure is of the ‘SEP-Q’ variant which does not compose the value function as a sum of scores in the hierarchy. Evidently, it is critical to compute the value function iteratively, so that values are well-initialised as we move to less restricted action spaces. Optimising each value head separately also means that the gradients they propagate to the encoder can compete for the learned representation, with potentially damaging effects.
The choice of target is less important: performing a max over coarser action spaces to construct the target as described in Section 4.2 does not improve learning speed as intended. One potential reason is that maximising over more potential targets increases the maximisation bias already present in -learning (Hasselt, 2010). Additionally, we use an -step objective which combines a partial on-policy return with the bootstrap target, which could reduce the relative impact of the choice of target. Surprisingly, the max-targets objective does lead to a slight increase in the final performance, by which time the behaviour policy only uses the most unrestricted action space.
Finally, we experiment with a higher . Unfortunately, asymptotic performance is degraded slightly once we use or higher. One potential reason is that it decreases the average group size, pushing against the limits of the spatial resolution that may be captured by our CNN architecture. Higher also considerably increase the amount of time that there are fewer units than groups, leaving certain groups empty. This renders our masked pooling operation degenerate, and may hurt the optimisation process. We do not see a fundamental limitation that should restrict the further growth of the action space, although we note that most hierarchical approaches in the literature avoid too many levels of depth. For example, Czarnecki et al. (2018) only mix between two sizes of action spaces rather than the three we progress through in the majority of our GAS experiments.
In this work, we presented an algorithm for growing action spaces with off-policy reinforcement learning to efficiently shape exploration. We learn value functions for all levels of a hierarchy of restricted action spaces simultaneously, and transfer data, value estimates, and representations from more restricted to less restricted action spaces. We also present a strategy for using this approach in cooperative multi-agent control. In discretised continuous control tasks and challenging multi-agent StarCraft micromanagement scenarios, we demonstrate empirically the effectiveness of our approach and the value of off-action-space learning. An interesting avenue for future work is to automatically identify how to restrict action spaces for efficient exploration, potentially through meta-optimisation. We also look to explore more complex and deeper hierarchies of action spaces.
We thank Danielle Rothermel, Daniel Gant, Jonas Gehring, Nicolas Carion, Daniel Haziza, Dexter Ju, and Vegard Mella for useful discussions and their work on the StarCraft codebase. This work was supported by the UK EPSRC CDT in Autonomous Intelligent Machines and Systems. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 637713).
- Asada et al. (1996) Minoru Asada, Shoichi Noda, Sukoya Tawaratsumida, and Koh Hosoda. Purposive behavior acquisition for a real robot by vision-based reinforcement learning. Machine learning, 23(2-3):279–303, 1996.
- Bengio et al. (2009) Yoshua Bengio, Jérôme Louradour, Ronan Collobert, and Jason Weston. Curriculum learning. In Proceedings of the 26th annual international conference on machine learning, pages 41–48. ACM, 2009.
- Chaslot et al. (2008) Guillaume M JB Chaslot, Mark HM Winands, H JAAP VAN DEN HERIK, Jos WHM Uiterwijk, and Bruno Bouzy. Progressive strategies for monte-carlo tree search. New Mathematics and Natural Computation, 4(03):343–357, 2008.
- Colombetti and Dorigo (1992) Marco Colombetti and Marco Dorigo. Robot shaping: developing situated agents through learning. International Computer Science Institute, 1992.
- Couëtoux et al. (2011) Adrien Couëtoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, and Nicolas Bonnard. Continuous upper confidence trees. In International Conference on Learning and Intelligent Optimization, pages 433–445. Springer, 2011.
- Czarnecki et al. (2018) Wojciech Marian Czarnecki, Siddhant M Jayakumar, Max Jaderberg, Leonard Hasenclever, Yee Whye Teh, Simon Osindero, Nicolas Heess, and Razvan Pascanu. Mix&match-agent curricula for reinforcement learning. arXiv preprint arXiv:1806.01780, 2018.
- Elman (1993) Jeffrey L Elman. Learning and development in neural networks: The importance of starting small. Cognition, 48(1):71–99, 1993.
- Espeholt et al. (2018) Lasse Espeholt, Hubert Soyer, Remi Munos, Karen Simonyan, Volodymir Mnih, Tom Ward, Yotam Doron, Vlad Firoiu, Tim Harley, Iain Dunning, et al. Impala: Scalable distributed deep-rl with importance weighted actor-learner architectures. arXiv preprint arXiv:1802.01561, 2018.
- Florensa et al. (2017) Carlos Florensa, David Held, Markus Wulfmeier, Michael Zhang, and Pieter Abbeel. Reverse curriculum generation for reinforcement learning. arXiv preprint arXiv:1707.05300, 2017.
- Graves et al. (2017) Alex Graves, Marc G Bellemare, Jacob Menick, Remi Munos, and Koray Kavukcuoglu. Automated curriculum learning for neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pages 1311–1320. JMLR. org, 2017.
- Hasselt (2010) Hado V Hasselt. Double q-learning. In Advances in Neural Information Processing Systems, pages 2613–2621, 2010.
Hessel et al. (2018)
Matteo Hessel, Joseph Modayil, Hado Van Hasselt, Tom Schaul, Georg Ostrovski,
Will Dabney, Dan Horgan, Bilal Piot, Mohammad Azar, and David Silver.
Rainbow: Combining improvements in deep reinforcement learning.
Thirty-Second AAAI Conference on Artificial Intelligence, 2018.
- Jaderberg et al. (2017) Max Jaderberg, Valentin Dalibard, Simon Osindero, Wojciech M Czarnecki, Jeff Donahue, Ali Razavi, Oriol Vinyals, Tim Green, Iain Dunning, Karen Simonyan, et al. Population based training of neural networks. arXiv preprint arXiv:1711.09846, 2017.
- Konidaris and Barto (2006) George Konidaris and Andrew Barto. Autonomous shaping: Knowledge transfer in reinforcement learning. In Proceedings of the 23rd international conference on Machine learning, pages 489–496. ACM, 2006.
- Lee et al. (2018) Dennis Lee, Haoran Tang, Jeffrey O Zhang, Huazhe Xu, Trevor Darrell, and Pieter Abbeel. Modular architecture for starcraft ii with deep reinforcement learning. In Fourteenth Artificial Intelligence and Interactive Digital Entertainment Conference, 2018.
- Mnih et al. (2015) Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Bellemare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level control through deep reinforcement learning. Nature, 518(7540):529, 2015.
- Mnih et al. (2016) Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu. Asynchronous methods for deep reinforcement learning. In International conference on machine learning, pages 1928–1937, 2016.
- Moore (1994) Andrew W Moore. The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces. In Advances in neural information processing systems, pages 711–718, 1994.
- Munos and Moore (2002) Rémi Munos and Andrew Moore. Variable resolution discretization in optimal control. Machine learning, 49(2-3):291–323, 2002.
- Murali et al. (2018) Adithyavairavan Murali, Lerrel Pinto, Dhiraj Gandhi, and Abhinav Gupta. Cassl: Curriculum accelerated self-supervised learning. In 2018 IEEE International Conference on Robotics and Automation (ICRA), pages 6453–6460. IEEE, 2018.
- Ng et al. (1999) Andrew Y Ng, Daishi Harada, and Stuart Russell. Policy invariance under reward transformations: Theory and application to reward shaping. In ICML, volume 99, pages 278–287, 1999.
Pentina et al. (2015)
Anastasia Pentina, Viktoriia Sharmanska, and Christoph H Lampert.
Curriculum learning of multiple tasks.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 5492–5500, 2015.
- Rashid et al. (2018) Tabish Rashid, Mikayel Samvelyan, Christian Schroeder de Witt, Gregory Farquhar, Jakob Foerster, and Shimon Whiteson. Qmix: Monotonic value function factorisation for deep multi-agent reinforcement learning. arXiv preprint arXiv:1803.11485, 2018.
- Ruder (2017) Sebastian Ruder. An overview of multi-task learning in deep neural networks. arXiv preprint arXiv:1706.05098, 2017.
- Samvelyan et al. (2019) Mikayel Samvelyan, Tabish Rashid, Christian Schroeder de Witt, Gregory Farquhar, Nantas Nardelli, Tim GJ Rudner, Chia-Man Hung, Philip HS Torr, Jakob Foerster, and Shimon Whiteson. The starcraft multi-agent challenge. 2019.
- Selfridge et al. (1985) Oliver G Selfridge, Richard S Sutton, and Andrew G Barto. Training and tracking in robotics. In IJCAI, pages 670–672, 1985.
- Silver et al. (2017) David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, et al. Mastering chess and shogi by self-play with a general reinforcement learning algorithm. arXiv preprint arXiv:1712.01815, 2017.
- Singh (1992) Satinder Pal Singh. Transfer of learning by composing solutions of elemental sequential tasks. Machine Learning, 8(3-4):323–339, 1992.
- Stanley and Miikkulainen (2004) Kenneth O Stanley and Risto Miikkulainen. Competitive coevolution through evolutionary complexification. Journal of artificial intelligence research, 21:63–100, 2004.
- Sukhbaatar et al. (2017) Sainbayar Sukhbaatar, Zeming Lin, Ilya Kostrikov, Gabriel Synnaeve, Arthur Szlam, and Rob Fergus. Intrinsic motivation and automatic curricula via asymmetric self-play. arXiv preprint arXiv:1703.05407, 2017.
- Sunehag et al. (2017) Peter Sunehag, Guy Lever, Audrunas Gruslys, Wojciech Marian Czarnecki, Vinicius Zambaldi, Max Jaderberg, Marc Lanctot, Nicolas Sonnerat, Joel Z Leibo, Karl Tuyls, et al. Value-decomposition networks for cooperative multi-agent learning. arXiv preprint arXiv:1706.05296, 2017.
- Synnaeve et al. (2016) Gabriel Synnaeve, Nantas Nardelli, Alex Auvolat, Soumith Chintala, Timothée Lacroix, Zeming Lin, Florian Richoux, and Nicolas Usunier. Torchcraft: a library for machine learning research on real-time strategy games. arXiv preprint arXiv:1611.00625, 2016.
- Tamar et al. (2016) Aviv Tamar, Yi Wu, Garrett Thomas, Sergey Levine, and Pieter Abbeel. Value iteration networks. In Advances in Neural Information Processing Systems, pages 2154–2162, 2016.
- Tan (1993) Ming Tan. Multi-agent reinforcement learning: Independent vs. cooperative agents. In Proceedings of the tenth international conference on machine learning, pages 330–337, 1993.
- Taylor et al. (2007) Matthew E Taylor, Peter Stone, and Yaxin Liu. Transfer learning via inter-task mappings for temporal difference learning. Journal of Machine Learning Research, 8(Sep):2125–2167, 2007.
- Tesauro (1995) Gerald Tesauro. Temporal difference learning and td-gammon. Communications of the ACM, 38(3):58–68, 1995.
- Usunier et al. (2016) Nicolas Usunier, Gabriel Synnaeve, Zeming Lin, and Soumith Chintala. Episodic exploration for deep deterministic policies: An application to starcraft micromanagement tasks. arXiv preprint arXiv:1609.02993, 2016.
- Vinyals et al. (2017) Oriol Vinyals, Timo Ewalds, Sergey Bartunov, Petko Georgiev, Alexander Sasha Vezhnevets, Michelle Yeo, Alireza Makhzani, Heinrich Küttler, John Agapiou, Julian Schrittwieser, et al. Starcraft ii: A new challenge for reinforcement learning. arXiv preprint arXiv:1708.04782, 2017.
- Vinyals et al. (2019) Oriol Vinyals, Igor Babuschkin, Junyoung Chung, Michael Mathieu, Max Jaderberg, Wojciech M. Czarnecki, Andrew Dudzik, Aja Huang, Petko Georgiev, Richard Powell, Timo Ewalds, Dan Horgan, Manuel Kroiss, Ivo Danihelka, John Agapiou, Junhyuk Oh, Valentin Dalibard, David Choi, Laurent Sifre, Yury Sulsky, Sasha Vezhnevets, James Molloy, Trevor Cai, David Budden, Tom Paine, Caglar Gulcehre, Ziyu Wang, Tobias Pfaff, Toby Pohlen, Yuhuai Wu, Dani Yogatama, Julia Cohen, Katrina McKinney, Oliver Smith, Tom Schaul, Timothy Lillicrap, Chris Apps, Koray Kavukcuoglu, Demis Hassabis, and David Silver. AlphaStar: Mastering the Real-Time Strategy Game StarCraft II. https://deepmind.com/blog/alphastar-mastering-real-time-strategy-game-starcraft-ii/, 2019.
- Wang et al. (2015) Ziyu Wang, Tom Schaul, Matteo Hessel, Hado Van Hasselt, Marc Lanctot, and Nando De Freitas. Dueling network architectures for deep reinforcement learning. arXiv preprint arXiv:1511.06581, 2015.
- Watkins and Dayan (1992) Christopher JCH Watkins and Peter Dayan. Q-learning. Machine learning, 8(3-4):279–292, 1992.
- Whiteson et al. (2007) Shimon Whiteson, Matthew E Taylor, Peter Stone, et al. Adaptive tile coding for value function approximation. Computer Science Department, University of Texas at Austin, 2007.
- Zaremba and Sutskever (2014) Wojciech Zaremba and Ilya Sutskever. Learning to execute. arXiv preprint arXiv:1410.4615, 2014.
8.1 Discretised continuous control
For our experiments in discretised continous control, we use a standard DQN trainer (Mnih et al., 2015) with the following parameters.
|replay buffer size||10000|
|target update interval||200|
|decay||25000 env steps|
|lead-in||25000 env steps|
|growth||25000 env steps|
|env steps per model udpate||4|
|Adam learning rate||5e-4|
For GAS experiments, we keep the mixing coefficient for 25000 environment steps, and then increase it linearly by 1 every 25000 steps until reaching the maximum value. We use for our Acrobot experiments, but reduce it to for Mountain Car to prevent diverging -values.
Our model consists of fully-connected ReLU layers, with 128 hidden units for the first and 64 hidden units for all subsequent layers.
Two layers are applied as an encoder.
Then, for each
Our model consists of fully-connected ReLU layers, with 128 hidden units for the first and 64 hidden units for all subsequent layers. Two layers are applied as an encoder. Then, for eachone layer is applied on the current embedding to produce a new embedding, and an evaluation layer on that embedding produces the -values for that level.
8.2 StarCraft micromanagement scenarios
8.2.1 Scenarios and learned strategies
We explore five Starcraft micromanagement scenarios: 50 hydralisks vs 50 hydralisks, 80 marines vs 80 marines, 80 marines vs 85 marines, 60 marines vs 65 marines, 95 zerglings vs 50 marines. In these scenarios, our model controls the first set of units, and the opponent controls the second set.
The opponent is a scripted opponent that holds its location until an opposing unit is within range to attack. Then, the opponent will engage in an "attack-closest" behavior, as described in Usunier et al. (2016), where each unit individually targets the closest unit to it. Having the opponent remain stationary until engaged makes this a more difficult problem – the agent must find its opponent, and attack into a defensive position, which requires good positions prior to engagement.
As mentioned in section 6.2, all of our scenarios require control of a much larger number of units than previous work. The 50 hydralisks and 80v80 marines scenarios are both imbalanced as a result of attacking into a defensive position. The optimal strategy for 80 marines vs 85 marines and 60 vs 65 marines requires slightly more sophisticated unit positioning, and the 95 zerglings vs 50 marines scenario requires the most precise positioning. The agent can use the enemy’s initial stationary positioning to its advantage by slightly surrounding the opponent in a concave, ensuring that the outermost units are in its attack range, but far enough away to be out of range of the center-most enemy units. Ideally, the timing of the groups in all scenarios should be coordinated such that all units get in range of the opponent at roughly the same point in time. Figure 4 shows how our model is able to exhibit this level of unit control.
We use a standard features for the units and map, given by TorchcraftAI 111https://github.com/TorchCraft/TorchCraftAI
For each of the units, the following features are extracted:
Current x, y positions.
Current x, y velocities.
Armor and damage values
Armor and damage types
Range versus both ground and air units
Current weapon cooldown
A few boolean flags on some miscellaneous unit attributes
Approximate normalization for each feature keep its value approximately between 0-1.
For the map, the following features are extracted for each tile in the map:
a one-hot encoding of tile’s the ground height (4 channels)
boolean representing or not the given tile is walkable
boolean representing or not the given tile is buildable
and boolean representing or not the given tile is covered by fog of war.
The features form a tensor, where our map has height and width .
8.2.3 Environment details
We use a frame-skip of 25, approximately 1 second of real time, allowing for reasonably fine-grained control but without making the exploration and credit assignment problems too challenging.
We calculate at every timestep the difference in total health points (HP) and number of units for the enemy from the last step, normalised by the total starting HP and unit count. As a reward function, we use the normalised damage dealt, plus 4 times the normalised units killed, plus an additional reward of 8 for winning the scenario by killing all enemy units. This reward function is designed such that the agent gets some reward for doing damage and killing units, but the reward from doing damage will never be greater than from winning the scenario. Ties and timeouts are considered losses.
8.3 Experimental details
As described in Section 6.2.2 a custom model architecture is used for Starcraft micromanagement.
Each unit’s feature vector is embedded to size 128 in step 2 of Figure .
The grid where the unit features and map features are scattered onto is the size of the Starcraft map of the scenario in walktiles downsampled by a factor of 8.
After being embedded, the unit features for ally and enemy units are concatenated with the downsampled map features and sent into a ResNet encoder with four residual blocks (stride 7 padding 3).
The output is an embedding of size 64.
a custom model architecture is used for Starcraft micromanagement. Each unit’s feature vector is embedded to size 128 in step 2 of Figure2
. The grid where the unit features and map features are scattered onto is the size of the Starcraft map of the scenario in walktiles downsampled by a factor of 8. After being embedded, the unit features for ally and enemy units are concatenated with the downsampled map features and sent into a ResNet encoder with four residual blocks (stride 7 padding 3). The output is an embedding of size 64.
The decoder uses a mean pooling over the embedding cells as described in Section 6.2.2. Each evaluator is a 2-layer MLP with 64 hidden units and 17 outputs, one for each action. All layers are separated with ReLU nonlinearities.
8.3.2 Training hyperparameters
We use 64 parallel actors to collect data in a short queue from which batches are removed when they are consumed by the learner. We use batches of 32 6-step segments for each update.
For the -learning experiments, we used the Adam optimizer with a learning rate of and . For the MM baseline experiments, we use a learning rate of , entropy loss coefficient of and value loss coefficient . The learning rates and entropy loss coefficient were tuned by random search, training with from scratch on the 80 marines vs 80 marines scenario with 10 configurations sampled from for the learning rate and for the entropy loss coefficient.
For -learning, we use an -greedy exploration strategy , decaying linearly from 1.0 to 0.1 over the first 10000 model updates. We also use a target network that copies the behaviour model’s parameters every 200 model updates.
We also use a linear schedule to grow the action-space. There is a lead in of 5000 model updates, during which the action-space is held constant at , to prevent the action space from growing when or the policy entropy is too high. The action-space is then grown linearly at a rate of 10000 model updates per level of restriction, so that after 10000 updates, we act entirely at and after 20000, entirely at .