Reward Propagation Using Graph Convolutional Networks
Martin Klissarov, Doina Precup
Abstract
Potential-based reward shaping provides an approach for designing good reward functions, with the purpose of speeding up learning. However, automatically finding potential functions for complex environments is a difficult problem (in fact, of the same difficulty as learning a value function from scratch). We propose a new framework for learning potential functions by leveraging ideas from graph representation learning. Our approach relies on Graph Convolutional Networks which we use as a key ingredient in combination with the probabilistic inference view of reinforcement learning. More precisely, we leverage Graph Convolutional Networks to perform message passing from rewarding states. The propagated messages can then be used as potential functions for reward shaping to accelerate learning. We verify empirically that our approach can achieve considerable improvements in both small and high-dimensional control problems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3c2ea412-5098-4f5f-9365-c5fe70c69128Cited by top-tier papers4
- Flexible Option LearningMartin Klissarov, Doina PrecupNeurIPS 2021 · 38 citations
- Deep Laplacian-based Options for Temporally-Extended ExplorationMartin Klissarov, Marlos C. MachadoICML 2023 · 31 citations
- Neural Algorithmic Reasoners are Implicit PlannersAndreea Deac, Petar Velickovic, Ognjen Milinkovic, Pierre-Luc Bacon et al.NeurIPS 2021 · 27 citations
- Snowflake: Scaling GNNs to high-dimensional continuous control via parameter freezingCharlie Blake, Vitaly Kurin, Maximilian Igl, Shimon WhitesonNeurIPS 2021 · 18 citations
Related papers
- Automatic Reward Shaping from Confounded Offline DataMingxuan Li, Junzhe Zhang, Elias BareinboimICML 2025
- Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph DrawingKaixin Wang, Kuangqi Zhou, Qixin Zhang, Jie Shao et al.ICML 2021 · 32 citations
- Graph Convolutional Reinforcement LearningJiechuan Jiang, Chen Dun, Tiejun Huang, Zongqing LuICLR 2020 · 415 citations
- Reachability-Aware Laplacian Representation in Reinforcement LearningKaixin Wang, Kuangqi Zhou, Jiashi Feng, Bryan Hooi et al.ICML 2023 · 10 citations
- Graph Reinforcement Learning for Network Control via Bi-Level OptimizationDaniele Gammelli, James Harrison, Kaidi Yang, Marco Pavone et al.ICML 2023 · 14 citations
