Robust Deep Reinforcement Learning Scheduling via Weight Anchoring

Steffen Gracla, Edgar Beck, Carsten Bockelmann, Armin Dekorsy
4/20/2023
cs.LGcs.AIeess.SY

No official code found. Best implementation: Steffengra/DL_Lottery (0 stars, MIT, last commit 2025-02-07).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

MIT
00PythonAug 18, 20211 years agoMIT

Similar Papers

Cite this paper

@article{gracla2023robust,
  title  = {Robust Deep Reinforcement Learning Scheduling via Weight Anchoring},
  author = {Steffen Gracla and Edgar Beck and Carsten Bockelmann and Armin Dekorsy},
  year   = {2023},
  eprint = {2304.10176},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.10176v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.10176.svg)](https://codeofpaper.com/paper/2304.10176)

Discussion