mlsanityData to 14 Oct 2026

Sharing Lifelong Reinforcement Learning Knowledge via Modulating Masks

arXiv 2305.10997 ↗First posted 18 May 2023cs.LG cs.AI cs.DCcited by 10

Not on the map. Why?

Abstract (arXiv)

Lifelong learning agents aim to learn multiple tasks sequentially over a lifetime. This involves the ability to exploit previous knowledge when learning new tasks and to avoid forgetting. Modulating masks, a specific type of parameter isolation approach, have recently shown promise in both supervised and reinforcement learning. While lifelong learning algorithms have been investigated mainly within a single-agent approach, a question remains on how multiple agents can share lifelong learning knowledge with each other. We show that the parameter isolation mechanism used by modulating masks is particularly suitable for exchanging knowledge among agents in a distributed and decentralized system of lifelong learners. The key idea is that the isolation of specific task knowledge to specific masks allows agents to transfer only specific knowledge on-demand, resulting in robust and effective distributed lifelong learning. We assume fully distributed and asynchronous scenarios with dynamic agent numbers and connectivity. An on-demand communication protocol ensures agents query their peers for specific masks to be transferred and integrated into their policies when facing each task. Experiments indicate that on-demand mask communication is an effective way to implement distributed lifelong reinforcement learning and provides a lifelong learning benefit with respect to distributed RL baselines such as DD-PPO, IMPALA, and PPO+EWC. The system is particularly robust to connection drops and demonstrates rapid learning due to knowledge exchange.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 50 of its 74 references that are in the map. First posted on arXiv 18 May 2023.

Builds on

50 of 74 references.

References · 50

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  4. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  5. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  6. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  7. 2019Advances and Open Problems in Federated Learningcited by 3,046
  8. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,258
  9. 2020Knowledge Distillation: A Surveycited by 1,603
  10. 2016Progressive Neural Networkscited by 1,361
  11. 2018Federated Learning with Non-IID Datacited by 1,108
  12. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
38 more
  1. 2018Experience Replay for Continual Learningcited by 1,095
  2. 2020Meta-Learning in Neural Networks: A Surveycited by 950
  3. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  4. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 883
  5. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
  6. 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
  7. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
  8. 2017Federated Multi-Task Learningcited by 672
  9. 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 672
  10. 2019Three scenarios for continual learningcited by 614
  11. 2018Progress & Compress: A scalable framework for continual learningcited by 520
  12. 2021Towards Personalized Federated Learningcited by 464
  13. 2019DD-PPO: Learning Near-Perfect PointGoal Navigators from 2.5 Billion Framescited by 362
  14. 2020Personalized Federated Learning: A Meta-Learning Approachcited by 312
  15. 2020Towards Continual Reinforcement Learning: A Review and Perspectivescited by 274
  16. 2019Improving Federated Learning Personalization via Model Agnostic Meta Learningcited by 269
  17. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
  18. 2020Supermasks in Superpositioncited by 227
  19. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  20. 2019Adaptive Gradient-Based Meta-Learning Methodscited by 183
  21. 2017Emergence of Locomotion Behaviours in Rich Environmentscited by 165
  22. 2021Continual World: A Robotic Benchmark For Continual Reinforcement Learningcited by 116
  23. 2021Federated Reinforcement Learning: Techniques, Applications, and Open Challengescited by 81
  24. 2018How Many Random Seeds? Statistical Power Analysis in Deep Reinforcement Learning Experimentscited by 60
  25. 2020Deep Reinforcement Learning amidst Lifelong Non-Stationaritycited by 43
  26. 2021Same State, Different Task: Continual Reinforcement Learning without Interferencecited by 43
  27. 2022Modular Lifelong Reinforcement Learning via Neural Compositioncited by 40
  28. 2020Lifelong Learning of Compositional Structurescited by 35
  29. 2021Lifelong Robotic Reinforcement Learning by Retaining Experiencescited by 34
  30. 2017Born to Learn: the Inspiration, Progress, and Future of Evolved Plastic Artificial Neural Networkscited by 29
  31. 2022Wasserstein Task Embedding for Measuring Task Similaritiescited by 25
  32. 2022Lifelong Reinforcement Learning with Modulating Maskscited by 22
  33. 2022Lifelong Learning Metricscited by 13
  34. 2023A Domain-Agnostic Approach for Characterization of Lifelong Learning Systemscited by 13
  35. 2021Context Meta-Reinforcement Learning via Neuromodulationcited by 11
  36. 2020Lifelong Learning Without a Task Oraclecited by 7
  37. 2022Signing the Supermask: Keep, Hide, Invertcited by 7
  38. 2023The configurable tree graph (CT-graph): measurable problems in partially observable and distal reward environments for lifelong reinforcement learningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

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

10 papers.