CAPS: Comprehensible Abstract Policy Summaries for Explaining Reinforcement Learning Agents
CAPS: Comprehensible Abstract Policy Summaries for Explaining Reinforcement Learning Agents
复制标题
DOI:
10.5555/3535850.3535950
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Joe McCalmon;Thai Le;Sarra M. Alqahtani;Dongwon Lee
中科院分区:
文献类型:
--
作者:
Joe McCalmon;Thai Le;Sarra M. Alqahtani;Dongwon Lee
As reinforcement learning (RL) continues to improve and be applied in situations alongside humans, the need to explain the learned behaviors of RL agents to end-users becomes more important. Strategies for explaining the reasoning behind an agent’s policy, called policy-level explanations , can lead to important insights about both the task and the agent’s behaviors. Following this line of research, in this work, we propose a novel approach, named as CAPS , that summarizes an agent’s policy in the form of a directed graph with natural language descriptions. A decision tree based clustering method is utilized to abstract the state space of the task into fewer, condensed states which makes the policy graphs more digestible to end-users. This abstraction allows the users to control the size of the policy graph to achieve their desired balance between comprehensi-bility and accuracy. In addition, we develop a heuristic optimization method to find the most explainable graph policy and present it to the users. Finally, we use the user-defined predicates to enrich the abstract states with semantic meaning. We test our approach on 5 RL tasks, using both deterministic and stochastic policies, and show that our method is: (1) agnostic to the algorithms used to train the policies, and (2) comparable in accuracy and superior in explanation capabilities to existing baselines. Especially, when provided with our explanation graph, end-users are able to accurately interpret policies of trained RL agents 80% of the time, compared to 10% when provided with the next best baseline. We make our code and datasets available to ensure the reproducibility of our research