Pith. sign in

REVIEW 1 cited by

Synthesising Reinforcement Learning Policies through Set-Valued Inductive Rule Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.06009 v1 pith:ZZXJHBWK submitted 2021-06-10 cs.AI cs.LG

classification cs.AIcs.LG
keywords policyalgorithmlearningrulesactionspersonreinforcementaction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Today's advanced Reinforcement Learning algorithms produce black-box policies, that are often difficult to interpret and trust for a person. We introduce a policy distilling algorithm, building on the CN2 rule mining algorithm, that distills the policy into a rule-based decision system. At the core of our approach is the fact that an RL process does not just learn a policy, a mapping from states to actions, but also produces extra meta-information, such as action values indicating the quality of alternative actions. This meta-information can indicate whether more than one action is near-optimal for a certain state. We extend CN2 to make it able to leverage knowledge about equally-good actions to distill the policy into fewer rules, increasing its interpretability by a person. Then, to ensure that the rules explain a valid, non-degenerate policy, we introduce a refinement algorithm that fine-tunes the rules to obtain good performance when executed in the environment. We demonstrate the applicability of our algorithm on the Mario AI benchmark, a complex task that requires modern reinforcement learning algorithms including neural networks. The explanations we produce capture the learned policy in only a few rules, that allow a person to understand what the black-box agent learned. Source code: https://gitlab.ai.vub.ac.be/yocoppen/svcn2

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems

    cs.AI 2026-07 conditional novelty 6.0 of 10

    A trained PPO policy is distilled into an executable first-order Prolog decision list that, after exact-return expansion, can match or exceed the teacher, with certified return loss and an O(1/B) fidelity/resolution theory.

Pith tools