Classical Graph-Algorithm Execution as a Controlled Testbed for Credit Assignment in Reinforcement Learning
Solo paper · Preprint, arXiv submission in progress (cs.LG)
Credit assignment, deciding which earlier action deserves the reward that arrives later, is among the oldest puzzles in reinforcement learning. This paper uses the step-by-step execution of classical graph algorithms such as BFS, DFS and Dijkstra as a controlled setting in which to study it, pairing graph neural networks with reinforcement learning.