mlsanityData to 14 Oct 2026

Boolean Decision Rules for Reinforcement Learning Policy Summarisation

arXiv 2207.08651 ↗First posted 18 Jul 2022cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Explainability of Reinforcement Learning (RL) policies remains a challenging research problem, particularly when considering RL in a safety context. Understanding the decisions and intentions of an RL policy offer avenues to incorporate safety into the policy by limiting undesirable actions. We propose the use of a Boolean Decision Rules model to create a post-hoc rule-based summary of an agent's policy. We evaluate our proposed approach using a DQN agent trained on an implementation of a lava gridworld and show that, given a hand-crafted feature representation of this gridworld, simple generalised rules can be created, giving a post-hoc explainable summary of the agent's policy. We discuss possible avenues to introduce safety into a RL agent's policy by using rules generated by this rule-based model as constraints imposed on the agent's policy, as well as discuss how creating simple rule summaries of an agent's policy may help in the debugging process of RL agents.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 12 references that are in the map. First posted on arXiv 18 Jul 2022.

Builds on

8 of 12 references.

References · 8

  1. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 786
  2. 2018Programmatically Interpretable Reinforcement Learningcited by 193
  3. 2017AI Safety Gridworldscited by 110
  4. 2017Trial without Error: Towards Safe Reinforcement Learning via Human Interventioncited by 103
  5. 2018Boolean Decision Rules via Column Generationcited by 80
  6. 2021A Survey on Interpretable Reinforcement Learningcited by 73
  7. 2021A Consciousness-Inspired Planning Agent for Model-Based Reinforcement Learningcited by 27
  8. 2020Interactive Visualization for Debugging RLcited by 5

Built on by

Cited by year

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

2 papers.