mlsanityData to 7 Oct 2026

RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratch

arXiv 2205.15043 ↗First posted 30 May 2022cs.LGcited by 30

Not on the map. Why?

Abstract (arXiv)

Training deep reinforcement learning (DRL) models usually requires high computation costs. Therefore, compressing DRL models possesses immense potential for training acceleration and model deployment. However, existing methods that generate small models mainly adopt the knowledge distillation-based approach by iteratively training a dense network. As a result, the training process still demands massive computing resources. Indeed, sparse training from scratch in DRL has not been well explored and is particularly challenging due to non-stationarity in bootstrap training. In this work, we propose a novel sparse DRL training framework, "the Rigged Reinforcement Learning Lottery" (RLx2), which builds upon gradient-based topology evolution and is capable of training a sparse DRL model based entirely on a sparse network. Specifically, RLx2 introduces a novel multi-step TD target mechanism with a dynamic-capacity replay buffer to achieve robust value learning and efficient topology exploration in sparse models. It also reaches state-of-the-art sparse training performance in several tasks, showing 7.5×-20× model compression with less than 3% performance degradation and up to 20× and 50× FLOPs reduction for training and inference, respectively.

Key facts. Cited by 30 papers in the map (data through 7 Oct 2026). Builds on 42 of its 57 references that are in the map. First posted on arXiv 30 May 2022.

Builds on

42 of 57 references.

References · 42

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  3. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  7. 2017Constrained Policy Optimizationcited by 928
  8. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  9. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  10. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  11. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  12. 2019Importance Estimation for Neural Network Pruningcited by 531
30 more
  1. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  2. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  3. 2015Policy Distillationcited by 414
  4. 2016Deep Reinforcement Learning for Robotic Manipulation with Asynchronous Off-Policy Updatescited by 342
  5. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  6. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  7. 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
  8. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
  9. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  10. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
  11. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  12. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  13. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  14. 2020Revisiting Fundamentals of Experience Replaycited by 171
  15. 2017Deep Rewiring: Training very sparse deep networkscited by 136
  16. 2021A Unified Lottery Ticket Hypothesis for Graph Neural Networkscited by 118
  17. 2018Kickstarting Deep Reinforcement Learningcited by 75
  18. 2020Transient Non-Stationarity and Generalisation in Deep Reinforcement Learningcited by 75
  19. 2016Training Sparse Neural Networkscited by 73
  20. 2019Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLPcited by 73
  21. 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
  22. 2021Powerpropagation: A sparsity inducing weight reparameterisationcited by 49
  23. 2019Understanding Multi-Step Deep Reinforcement Learning: A Systematic Study of the DQN Targetcited by 31
  24. 2020PoPS: Policy Pruning and Shrinking for Deep Reinforcement Learningcited by 30
  25. 2018Learning Sparse Neural Networks via Sensitivity-Driven Regularizationcited by 26
  26. 2019Evaluating Lottery Tickets Under Distributional Shiftscited by 23
  27. 2020Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecturecited by 23
  28. 2021On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learningcited by 23
  29. 2021Single-Shot Pruning for Offline Reinforcement Learningcited by 21
  30. 2021GST: Group-Sparse Training for Accelerating Deep Reinforcement Learningcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 9; 2025: 13; 2026: 3.

30 papers.

Sort:

By area:

  1. 2023The Dormant Neuron Phenomenon in Deep Reinforcement Learningcited by 171
  2. 2024Mixtures of Experts Unlock Parameter Scaling for Deep RLcited by 75
  3. 2025Reinforcement Learning Finetunes Small Subnetworks in Large Language Modelscited by 46
  4. 2024In value-based deep reinforcement learning, a pruned network is a good networkcited by 38
  5. 2024Mixture of Experts in a Mixture of RL settingscited by 21
  6. 2024Neuroplastic Expansion in Deep Reinforcement Learningcited by 17
  7. 2023Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Trainingcited by 16
  8. 2025Measure gradients, not activations! Enhancing neuronal activity in deep reinforcement learningcited by 14
  9. 2023Automatic Noise Filtering with Dynamic Sparse Training in Deep Reinforcement Learningcited by 13
  10. 2024Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustnesscited by 11
  11. 2025Network Sparsity Unlocks the Scaling Potential of Deep Reinforcement Learningcited by 11
  12. 2023Genes in Intelligent Agentscited by 9
18 more
  1. 2025Asymmetric Proximal Policy Optimization: mini-critics boost LLM reasoningcited by 9
  2. 2025Eau De Q-Network: Adaptive Distillation of Neural Networks in Deep Reinforcement Learningcited by 6
  3. 2024Kaleidoscope: Learnable Masks for Heterogeneous Multi-agent Reinforcement Learningcited by 5
  4. 2025Mind the GAP! The Challenges of Scale in Pixel-based Deep Reinforcement Learningcited by 4
  5. 2024Navigating Extremes: Dynamic Sparsity in Large Output Spacescited by 3
  6. 2025Reinforcement Learning Fine-Tunes a Sparse Subnetwork in Large Language Modelscited by 2
  7. 2024Hadamard Representation: Scaffolding Performance Across Model-free RLcited by 1
  8. 2024Value-Based Deep Multi-Agent Reinforcement Learning with Dynamic Sparse Trainingcited by 1
  9. 2025Leave it to the Specialist: Repair Sparse LLMs with Sparse Fine-Tuning via Sparsity Evolutioncited by 1
  10. 2025Rethinking the Role of Dynamic Sparse Training for Scalable Deep Reinforcement Learningcited by 1
  11. 2025Learning Quantized Continuous Controllers for Integer Hardwarecited by 1
  12. 2025Differentiable Weightless Controllers: Learning Logic Circuits for Continuous Controlcited by 1
  13. 2023One is More: Diverse Perspectives within a Single Network for Efficient DRLcited by 0
  14. 2025NeuroTrails: Training with Dynamic Sparse Heads as the Key to Effective Ensemblingcited by 0
  15. 2025Efficient Reinforcement Learning by Reducing Forgetting with Elephant Activation Functionscited by 0
  16. 2026RNM-TD3: N:M Semi-structured Sparse Reinforcement Learning From Scratchcited by 0
  17. 2026Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scalingcited by 0
  18. 2026Structure-Conditioned Actor-Critic Branches for Quality-Diversity Reinforcement Learningcited by 0