TY - GEN
T1 - Discovering User-Interpretable Capabilities of Black-Box Planning Agents
AU - Verma, Pulkit
AU - Marpally, Shashank Rao
AU - Srivastava, Siddharth
N1 - Publisher Copyright:
© 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022. All rights reserved.
PY - 2022
Y1 - 2022
N2 - Several approaches have been developed for answering users' specific questions about AI behavior and for assessing their core functionality in terms of primitive executable actions. However, the problem of summarizing an AI agent's broad capabilities for a user is comparatively new. This paper presents an algorithm for discovering from scratch the suite of high-level “capabilities” that an AI system with arbitrary internal planning algorithms/policies can perform. It computes conditions describing the applicability and effects of these capabilities in user-interpretable terms. Starting from a set of user-interpretable state properties, an AI agent, and a simulator that the agent can interact with, our algorithm returns a set of high-level capabilities with their parameterized descriptions. Empirical evaluation on several game-based scenarios shows that this approach efficiently learns descriptions of various types of AI agents in deterministic, fully observable settings. User studies show that such descriptions are easier to understand and reason with than the agent's primitive actions.
AB - Several approaches have been developed for answering users' specific questions about AI behavior and for assessing their core functionality in terms of primitive executable actions. However, the problem of summarizing an AI agent's broad capabilities for a user is comparatively new. This paper presents an algorithm for discovering from scratch the suite of high-level “capabilities” that an AI system with arbitrary internal planning algorithms/policies can perform. It computes conditions describing the applicability and effects of these capabilities in user-interpretable terms. Starting from a set of user-interpretable state properties, an AI agent, and a simulator that the agent can interact with, our algorithm returns a set of high-level capabilities with their parameterized descriptions. Empirical evaluation on several game-based scenarios shows that this approach efficiently learns descriptions of various types of AI agents in deterministic, fully observable settings. User studies show that such descriptions are easier to understand and reason with than the agent's primitive actions.
UR - http://www.scopus.com/inward/record.url?scp=85141825038&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85141825038&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85141825038
T3 - 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022
SP - 362
EP - 372
BT - 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022
PB - International Joint Conferences on Artificial Intelligence
T2 - 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022
Y2 - 31 July 2022 through 5 August 2022
ER -