Value-Based Deep Multi-Agent Reinforcement Learning with Dynamic Sparse Training
Not on the map. Why?
Abstract (arXiv)
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× in Floating Point Operations (FLOPs) for both training and inference, with less than 3% performance degradation.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 56 of its 76 references that are in the map. First posted on arXiv 28 Sep 2024.
Builds on
56 of 76 references.
References · 56
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
- 2015Prioritized Experience Replaycited by 1,070
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 903
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2019The StarCraft Multi-Agent Challengecited by 589
38 more
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2019Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithmscited by 555
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2020Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 475
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2019QTRAN: Learning to Factorize with Transformation for Cooperative Multi-Agent Reinforcement Learningcited by 372
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2019Emergent Tool Use From Multi-Agent Autocurriculacited by 308
- 2016Safe, Multi-Agent, Reinforcement Learning for Autonomous Drivingcited by 301
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2018Human-level performance in first-person multiplayer games with population-based deep reinforcement learningcited by 260
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2020Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 197
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2020FACMAC: Factored Multi-Agent Centralised Policy Gradientscited by 178
- 2020Revisiting Fundamentals of Experience Replaycited by 171
- 2017Deep Rewiring: Training very sparse deep networkscited by 136
- 2021Celebrating Diversity in Shared Multi-Agent Reinforcement Learningcited by 96
- 2021Scaling Multi-Agent Reinforcement Learning with Selective Parameter Sharingcited by 85
- 2018Kickstarting Deep Reinforcement Learningcited by 75
- 2020Transient Non-Stationarity and Generalisation in Deep Reinforcement Learningcited by 75
- 2016Training Sparse Neural Networkscited by 73
- 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
- 2019The Difficulty of Training Sparse Neural Networkscited by 62
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
- 2021Plan Better Amid Conservatism: Offline Multi-Agent Reinforcement Learning with Actor Rectificationcited by 59
- 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
- 2021Powerpropagation: A sparsity inducing weight reparameterisationcited by 49
- 2019Reducing Overestimation Bias in Multi-Agent Domains Using Double Centralized Criticscited by 46
- 2020PoPS: Policy Pruning and Shrinking for Deep Reinforcement Learningcited by 30
- 2022RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratchcited by 30
- 2019Evaluating Lottery Tickets Under Distributional Shiftscited by 23
- 2020Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecturecited by 23
- 2021On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learningcited by 23
- 2021Regularized Softmax Deep Multi-Agent Q-Learningcited by 19
50 most cited of 56 All 56 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.