mlsanityData to 7 Oct 2026

Relational Abstractions for Generalized Reinforcement Learning on Symbolic Problems

arXiv 2204.12665 ↗First posted 27 Apr 2022cs.LG cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning in problems with symbolic state spaces is challenging due to the need for reasoning over long horizons. This paper presents a new approach that utilizes relational abstractions in conjunction with deep learning to learn a generalizable Q-function for such problems. The learned Q-function can be efficiently transferred to related problems that have different object names and object quantities, and thus, entirely different state spaces. We show that the learned generalized Q-function can be utilized for zero-shot transfer to related problems without an explicit, hand-coded curriculum. Empirical evaluations on a range of problems show that our method facilitates efficient zero-shot transfer of learned knowledge to much larger problem instances containing many objects.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 10 of its 45 references that are in the map. First posted on arXiv 27 Apr 2022.

Builds on

10 of 45 references.

References · 10

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  4. 2017Hindsight Experience Replaycited by 1,096
  5. 2017Learning Generalized Reactive Policies using Deep Neural Networkscited by 39
  6. 2018Learning Features and Abstract Actions for Computing Generalized Planscited by 35
  7. 2018Learning Curriculum Policies for Reinforcement Learningcited by 34
  8. 2020Learning Generalized Relational Heuristic Networks for Model-Agnostic Planningcited by 22
  9. 2019Size Independent Neural Transfer for RDDL Planningcited by 12
  10. 2020Fitted Q-Learning for Relational Domainscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 2; 2024: 1; 2025: 0; 2026: 2.

7 papers.