Robust Deep Reinforcement Learning Scheduling via Weight Anchoring
Not on the map. Why?
Abstract (arXiv)
Questions remain on the robustness of data-driven learning methods when crossing the gap from simulation to reality. We utilize weight anchoring, a method known from continual learning, to cultivate and fixate desired behavior in Neural Networks. Weight anchoring may be used to find a solution to a learning problem that is nearby the solution of another learning problem. Thereby, learning can be carried out in optimal environments without neglecting or unlearning desired behavior. We demonstrate this approach on the example of learning mixed QoS-efficient discrete resource scheduling with infrequent priority messages. Results show that this method provides performance comparable to the state of the art of augmenting a simulation environment, alongside significantly increased robustness and steerability.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 12 references that are in the map. First posted on arXiv 20 Apr 2023.
Builds on
10 of 12 references.
References · 10
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2017Robust Adversarial Reinforcement Learningcited by 439
- 2018Deep Learning in Mobile and Wireless Networking: A Surveycited by 117
- 2019Experienced Deep Reinforcement Learning with Generative Adversarial Networks (GANs) for Model-Free Ultra Reliable Low Latency Communicationcited by 21
- 2019The problem with DDPG: understanding failures in deterministic environments with sparse rewardscited by 20
- 2017Autonomous Braking System via Deep Reinforcement Learningcited by 18
- 2023Learning Resource Scheduling with High Priority Users using Deep Deterministic Policy Gradientscited by 2
Built on by
Citing papers per year: 2023: 1.
1 paper.