Value-Based Deep Multi-Agent Reinforcement Learning with Dynamic Sparse Training

Deep Multi-agent Reinforcement Learning (MARL) relies on neural networks with numerous parameters in multi-agent scenarios, often incurring substantial computational overhead. Consequently, there is an urgent need to expedite training and enable model compression in MARL. This paper proposes the utilization of dynamic sparse training (DST), a technique proven effective in deep supervised learning tasks, to alleviate the computational burdens in MARL training. However, a direct adoption of DST fails to yield satisfactory MARL agents, leading to breakdowns in value learning within deep sparse value-based MARL models. Motivated by this challenge, we introduce an innovative Multi-Agent Sparse Training (MAST) framework aimed at simultaneously enhancing the reliability of learning targets and the rationality of sample distribution to improve value learning in sparse models. Specifically, MAST incorporates the Soft Mellowmax Operator with a hybrid TD-($λ$) schema to establish dependable learning targets. Additionally, it employs a dual replay buffer mechanism to enhance the distribution of training samples. Building upon these aspects, MAST utilizes gradient-based topology evolution to exclusively train multiple MARL agents using sparse networks. Our comprehensive experimental investigation across various value-based MARL algorithms on multiple benchmarks demonstrates, for the first time, significant reductions in redundancy of up to $20\times$ in Floating Point Operations (FLOPs) for both training and inference, with less than $3\%$ performance degradation.

Paper

References (76)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer 8jXp5/10 · confidence 3/52024-07-11

Summary

The paper introduces the Multi-Agent Sparse Training (MAST) framework to address computational overhead in Multi-agent Reinforcement Learning (MARL) by enhancing value learning through the Soft Mellowmax Operator with a hybrid TD-(λ) schema and a dual replay buffer mechanism. MAST achieves significant reductions in computational redundancy with minimal performance degradation.

Strengths

- The problem of applying sparsity training to MARL is a topic. - The paper is well-written and easy to understand. - Comprehensive evaluation and ablation results provide a good understanding of the method and design decision.

Weaknesses

- This work focuses only on one benchmark (StarCraft II), applying it to other benchmarks can give us a better idea of the generalizability of the approach. - How does the proposed technique compare to single-agent RL sparse training work such as "Sokar et al., 2022". Are there existing methods that are already able to achieve high performance with the techniques proposed in this work? The authors also mentioned that "Wang et al., 2019" also prunes agent networks throughout training, so it would be good to compare also to this work to see the computation reduction and performance comparison.

Questions

- Is Figure 7 for illustration purposes (i.e. not using real data)? if so, I would suggest using real data to illustrate the idea and better show the significance of the issue. - How does this technique generalize to test environments other than StartCraft II? - How does the proposed approach compare to the single agent sparse training other than the RLx2 method?

Rating

5

Confidence

3

Soundness

3

Presentation

4

Contribution

3

Limitations

More analysis of the method's limitations would be helpful.

Authorsrebuttal2024-08-13

Reminder to Reviewer 8jXp

Dear Reviewer, Thank you for your time and effort in reviewing our paper. We hope our response has adequately addressed your concerns. If you feel that our rebuttal has clarified the issues raised, we kindly ask you to consider adjusting your score accordingly. Should you have any further questions or need additional clarification, we would be more than happy to discuss them with you. Thank you once again for your valuable feedback.

Reviewer zAbe6/10 · confidence 4/52024-07-13

Summary

The paper presents a significant advancement in the field of MARL by introducing the MAST framework which aims at improving the Reliability of Training Targets and Improving the Rationality of Sample Distribution. Overall this paper is well-written and easy to follow, on a very interesting research direction with promising results.

Strengths

This paper did thorough research on finding the reasons with theoretical contribution and possible solutions for the poor performance of previous specification methods and introduced 2 novel designs to solve them. The paper provides solid theoretical underpinnings for the proposed methods. The experimental results look very promising.

Weaknesses

An ablation study would be good to tell to how much extent the 2 designs are contributing to the performance improvement. The overhead brought by the new design was not discussed.

Questions

What kind of sparsification techniques are used in MAST? Also are mixing networks sparsified? The agent network in qmix is relatively very small, how is it possible to reach a 95% sparsification while maintaining a relatively high or even better results compared to the dense networks?

Rating

6

Confidence

4

Soundness

3

Presentation

3

Contribution

3

Limitations

The authors did not address the limitations but I don't see a direct or potential negative societal impact from this work.

Reviewer fbhH7/10 · confidence 3/52024-07-13

Summary

This paper introduces dynamic sparse training (DST) to the Deep Multi-Agent Reinforcement Learning (MARL) settings for the first time in the literature. Furthermore, it shows that applying directly DST algorithms to MARL does not lead to optimal results. Consequently, it proposes a new framework named Multi-Agent Sparse Training (MAST) which enhances the DST RigL algorithm with a hybrid TD-(λ) schema and a dual replay buffer mechanism in order to successfully cope with the challenging MARL settings. An extensive empirical validation is performed showing that MAST can reduce up to 20x the computational requirements at virtually no loss in performance.

Strengths

* This is an original paper which introduces for the first time DST to MARL. * The paper solves the inherent problems and the suboptimal behavior of directly applying DST to MARL by proposing a new framework MAST which is specially designed for MARL. * The paper is clear and well written. The source code is provided for easy reproducibility. * The extensive empirical validation shows the superiority of the proposed framework in comparison with the most common sense baselines as there is no other DST method specially designed for MARL. * It is likely that the paper to have a fair impact on the sparse training and multi-agent reinforcement learning communities.

Weaknesses

* Up to my best understanding, there seems to be no striking weak points.

Questions

Q1) While the theoretical reduction in terms of computational resources is impressive, can you comment on the real wall-clock running time? I know that this is not possible when simulating sparsity with binary masks, but have you considered using some truly sparse implementation of the neural networks? While I am not sure how easy would be to do this for the GRU layer, there exists some sparse MLP implementations for supervised learning (e.g., Curci et al., Truly Sparse Neural Networks at Scale, arXiv:2102.01732, 2021) which may be easy to adapt to the MAST framework. This may allow you to design an experiment where you can scale up (in terms of the number of neurons) seriously the neural network for very large state or action spaces which as you mentioned is a typical challenge in MARL. Q2) (minor) I suggest adopting a uniform citation style in order to improve related work chronological readability. Currently, some of the references are cited using the year of the first preprint release on arXiv, while others are cited using the official publication year.

Rating

7

Confidence

3

Soundness

3

Presentation

3

Contribution

3

Limitations

n/a

Authorsrebuttal2024-08-11

Reminder to Reviewer zAbe

Dear Reviewer, Thank you for your time and effort in reviewing our paper. We hope our response has adequately addressed your concerns. If you feel that our rebuttal has clarified the issues raised, we kindly ask you to consider adjusting your score accordingly. Should you have any further questions or need additional clarification, we would be more than happy to discuss them with you. Thank you once again for your valuable feedback.

Reviewer zAbe2024-08-12

I thank the authors for their response. I'd like to remain my original rating of this paper.

Authorsrebuttal2024-08-11

Reminder to Reviewer 8jXp

Dear Reviewer, Thank you for your time and effort in reviewing our paper. We hope our response has adequately addressed your concerns. If you feel that our rebuttal has clarified the issues raised, we kindly ask you to consider adjusting your score accordingly. Should you have any further questions or need additional clarification, we would be more than happy to discuss them with you. Thank you once again for your valuable feedback.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC