mlsanityData to 14 Oct 2026

Learning of Generalizable and Interpretable Knowledge in Grid-Based Reinforcement Learning Environments

arXiv 2309.03651 ↗First posted 7 Sep 2023cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Understanding the interactions of agents trained with deep reinforcement learning is crucial for deploying agents in games or the real world. In the former, unreasonable actions confuse players. In the latter, that effect is even more significant, as unexpected behavior cause accidents with potentially grave and long-lasting consequences for the involved individuals. In this work, we propose using program synthesis to imitate reinforcement learning policies after seeing a trajectory of the action sequence. Programs have the advantage that they are inherently interpretable and verifiable for correctness. We adapt the state-of-the-art program synthesis system DreamCoder for learning concepts in grid-based environments, specifically, a navigation task and two miniature versions of Atari games, Space Invaders and Asterix. By inspecting the generated libraries, we can make inferences about the concepts the black-box agent has learned and better understand the agent's behavior. We achieve the same by visualizing the agent's decision-making process for the imitated sequences. We evaluate our approach with different types of program synthesizers based on a search-only method, a neural-guided search, and a language model fine-tuned on code.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 7 Sep 2023.

Builds on

20 of 39 references.

References · 20

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2021Program Synthesis with Large Language Modelscited by 3,637
  4. 2022Competition-Level Code Generation with AlphaCodecited by 1,462
  5. 2021CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generationcited by 906
  6. 2021PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Modelscited by 411
  7. 2018Neural-Symbolic VQA: Disentangling Reasoning from Vision and Language Understandingcited by 304
  8. 2018Programmatically Interpretable Reinforcement Learningcited by 193
  9. 2018Verifiable Reinforcement Learning via Policy Extractioncited by 177
  10. 2022Evolving Curricula with Regret-Based Environment Designcited by 173
  11. 2022Synchromesh: Reliable code generation from pre-trained language modelscited by 156
  12. 2016DeepCoder: Learning to Write Programscited by 149
8 more
  1. 2021Learning to Synthesize Programs as Interpretable and Generalizable Policiescited by 59
  2. 2022Top-Down Synthesis for Library Learningcited by 58
  3. 2020Neurosymbolic Reinforcement Learning with Formally Verified Explorationcited by 49
  4. 2019Learning to Infer Program Sketchescited by 44
  5. 2019Few-Shot Bayesian Imitation Learning with Logical Program Policiescited by 30
  6. 2022babble: Learning Better Abstractions with E-Graphs and Anti-Unificationcited by 23
  7. 2020Learning to learn generative programs with Memoised Wake-Sleepcited by 15
  8. 2019Forgetting to learn logic programscited by 8

Built on by

Cited by year

Citing papers per year: 2024: 3; 2025: 2.

5 papers.