BET: Explaining Deep Reinforcement Learning through The Error-Prone Decisions

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Liu, Xiao, Zhao, Jie, Chen, Wubing, Tan, Mao, Su, Yongxing
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911758248050688
author Liu, Xiao
Zhao, Jie
Chen, Wubing
Tan, Mao
Su, Yongxing
author_facet Liu, Xiao
Zhao, Jie
Chen, Wubing
Tan, Mao
Su, Yongxing
contents Despite the impressive capabilities of Deep Reinforcement Learning (DRL) agents in many challenging scenarios, their black-box decision-making process significantly limits their deployment in safety-sensitive domains. Several previous self-interpretable works focus on revealing the critical states of the agent's decision. However, they cannot pinpoint the error-prone states. To address this issue, we propose a novel self-interpretable structure, named Backbone Extract Tree (BET), to better explain the agent's behavior by identify the error-prone states. At a high level, BET hypothesizes that states in which the agent consistently executes uniform decisions exhibit a reduced propensity for errors. To effectively model this phenomenon, BET expresses these states within neighborhoods, each defined by a curated set of representative states. Therefore, states positioned at a greater distance from these representative benchmarks are more prone to error. We evaluate BET in various popular RL environments and show its superiority over existing self-interpretable models in terms of explanation fidelity. Furthermore, we demonstrate a use case for providing explanations for the agents in StarCraft II, a sophisticated multi-agent cooperative game. To the best of our knowledge, we are the first to explain such a complex scenarios using a fully transparent structure.
format Preprint
id arxiv_https___arxiv_org_abs_2401_07263
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle BET: Explaining Deep Reinforcement Learning through The Error-Prone Decisions
Liu, Xiao
Zhao, Jie
Chen, Wubing
Tan, Mao
Su, Yongxing
Machine Learning
Artificial Intelligence
Despite the impressive capabilities of Deep Reinforcement Learning (DRL) agents in many challenging scenarios, their black-box decision-making process significantly limits their deployment in safety-sensitive domains. Several previous self-interpretable works focus on revealing the critical states of the agent's decision. However, they cannot pinpoint the error-prone states. To address this issue, we propose a novel self-interpretable structure, named Backbone Extract Tree (BET), to better explain the agent's behavior by identify the error-prone states. At a high level, BET hypothesizes that states in which the agent consistently executes uniform decisions exhibit a reduced propensity for errors. To effectively model this phenomenon, BET expresses these states within neighborhoods, each defined by a curated set of representative states. Therefore, states positioned at a greater distance from these representative benchmarks are more prone to error. We evaluate BET in various popular RL environments and show its superiority over existing self-interpretable models in terms of explanation fidelity. Furthermore, we demonstrate a use case for providing explanations for the agents in StarCraft II, a sophisticated multi-agent cooperative game. To the best of our knowledge, we are the first to explain such a complex scenarios using a fully transparent structure.
title BET: Explaining Deep Reinforcement Learning through The Error-Prone Decisions
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2401.07263