Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kayla Boggess

dblp:261/3812 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
5since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 4 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-author · 5 since 2021Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Reinforcement learning · 50% Trustworthy machine learning · 41% Multi-agent systems · 8%
Human-computer interaction and pervasive computing
3 papers
Human-AI interaction · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
multi-agent reinforcement learning
3.142026
Explaining Decentralized Multi-Agent Reinforcement Learning Policies · AAAI 2026
Explanations for Multi-Agent Reinforcement Learning · AAAI 2025
Explainable Multi-Agent Reinforcement Learning for Temporal Queries · IJCAI 2023
Human-AI interaction
explainable AI
1.922026
Explaining Decentralized Multi-Agent Reinforcement Learning Policies · AAAI 2026
Explanations for Multi-Agent Reinforcement Learning · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability › explainable reinforcement learning
policy explanation
1.222023
Explainable Multi-Agent Reinforcement Learning for Temporal Queries · IJCAI 2023
Toward Policy Explanations for Multi-Agent Reinforcement Learning · IJCAI 2022
Machine learning › Trustworthy machine learning
interpretability
0.822023
Toward Policy Explanations for Multi-Agent Reinforcement Learning · IJCAI 2022
Explainable Multi-Agent Reinforcement Learning for Temporal Queries · IJCAI 2023
Automated reasoning and model checking › model checking
probabilistic model checking
0.712023
Explainable Multi-Agent Reinforcement Learning for Temporal Queries · IJCAI 2023
Machine learning › Trustworthy machine learning › interpretability
explainable reinforcement learning
0.612022
Toward Policy Explanations for Multi-Agent Reinforcement Learning · IJCAI 2022
Knowledge, reasoning and agents › Multi-agent systems › multi-agent decision making
decentralized decision-making
0.622026
Explaining Decentralized Multi-Agent Reinforcement Learning Policies · AAAI 2026
Explanations for Multi-Agent Reinforcement Learning · AAAI 2025
Machine learning › Reinforcement learning
safety-critical decision making
0.312025
Towards Computational Foreseeability · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability › local explanation
contrastive explanation
0.212023
Explainable Multi-Agent Reinforcement Learning for Temporal Queries · IJCAI 2023
Human-AI interaction
human-AI collaboration
0.212022
Toward Policy Explanations for Multi-Agent Reinforcement Learning · IJCAI 2022

Methods — techniques the papers use, named apart from their topics

user study · 2.0post-hoc explanation · 1.7probabilistic model checking · 1.3PCTL · 1.3reward maximization · 0.9legal BPL formula · 0.9cost minimization · 0.9
YearPublicationVenuePosition
2026 Explaining Decentralized Multi-Agent Reinforcement Learning Policies
abstract
Multi-Agent Reinforcement Learning (MARL) has gained significant interest in recent years, enabling sequential decision-making across multiple agents in various domains. However, most existing explanation methods focus on centralized MARL, failing to address the uncertainty and nondeterminism inherent in decentralized settings. We propose methods to generate policy summarizations that capture task ordering and agent cooperation in decentralized MARL policies, along with query-based explanations for “When,” “Why Not,” and “What” types of user queries about specific agent behaviors. We evaluate our approach across four MARL domains and two decentralized MARL algorithms, demonstrating its generalizability and computational efficiency. User studies show that our summarizations and explanations significantly improve user question-answering performance and enhance subjective ratings on metrics such as understanding and satisfaction.
Kayla Boggess, Sarit Kraus, Lu Feng 0001
AAAI1
2025 Explanations for Multi-Agent Reinforcement Learning
abstract
Explainable reinforcement learning (xRL) provides explanations for ``black-box" decision making systems. However, most work in xRL is based on single-agent settings instead of the more complex multi-agent reinforcement learning (MARL). Several different types of post-hoc explanations must be provided to increase understanding of both centralized and decentralized MARL systems. For centralized MARL, this research develops methods to generate global policy summaries, query-based explanations, and temporal explanations. For decentralized MARL, this research develops global policy summaries and query-based explanations.
Kayla Boggess
AAAI1
2025 Towards Computational Foreseeability
abstract
This paper addresses the challenges of computational accountability in autonomous systems, particularly in Autonomous Vehicles (AVs), where safety and efficiency often conflict. We begin by examining current approaches such as cost minimization, reward maximization, human-centered approaches, and ethical frameworks, noting their limitations addressing these challenges. Foreseeability is a central concept in tort law that limits the accountability and legal liability of an actor to a reasonable scope. Yet, current data-driven methods to determine foreseeability are rigid, ignore uncertainty, and depend on simulation data. In this work, we advocate for a new computational approach to establish foreseeability of autonomous systems based on the legal “BPL” formula. We provide open research challenges, using fully autonomous vehicles as a motivating example, and call for researchers to help autonomous systems make accountable decisions in safety-critical scenarios.
Sarit Kraus, Kayla Boggess, Robert Kim, Bryan H. Choi, Lu Feng 0001
AAAI2
2023 Explainable Multi-Agent Reinforcement Learning for Temporal Queries
abstract
As multi-agent reinforcement learning (MARL) systems are increasingly deployed throughout society, it is imperative yet challenging for users to understand the emergent behaviors of MARL agents in complex environments. This work presents an approach for generating policy-level contrastive explanations for MARL to answer a temporal user query, which specifies a sequence of tasks completed by agents with possible cooperation. The proposed approach encodes the temporal query as a PCTL* logic formula and checks if the query is feasible under a given MARL policy via probabilistic model checking. Such explanations can help reconcile discrepancies between the actual and anticipated multi-agent behaviors. The proposed approach also generates correct and complete explanations to pinpoint reasons that make a user query infeasible. We have successfully applied the proposed approach to four benchmark MARL domains (up to 9 agents in one domain). Moreover, the results of a user study show that the generated explanations significantly improve user performance and satisfaction.
Kayla Boggess, Sarit Kraus, Lu Feng 0001
IJCAI1
2022 Toward Policy Explanations for Multi-Agent Reinforcement Learning
abstract
Advances in multi-agent reinforcement learning (MARL) enable sequential decision making for a range of exciting multi-agent applications such as cooperative AI and autonomous driving. Explaining agent decisions is crucial for improving system transparency, increasing user satisfaction, and facilitating human-agent collaboration. However, existing works on explainable reinforcement learning mostly focus on the single-agent setting and are not suitable for addressing challenges posed by multi-agent environments. We present novel methods to generate two types of policy explanations for MARL: (i) policy summarization about the agent cooperation and task sequence, and (ii) language explanations to answer queries about agent behavior. Experimental results on three MARL domains demonstrate the scalability of our methods. A user study shows that the generated explanations significantly improve user performance and increase subjective ratings on metrics such as user satisfaction.
Kayla Boggess, Sarit Kraus, Lu Feng 0001
IJCAI1
2020 Towards Transparent Robotic Planning via Contrastive Explanations
abstract
Providing explanations of chosen robotic actions can help to increase the transparency of robotic planning and improve users' trust. Social sciences suggest that the best explanations are contrastive, explaining not just why one action is taken, but why one action is taken instead of another. We formalize the notion of contrastive explanations for robotic planning policies based on Markov decision processes, drawing on insights from the social sciences. We present methods for the automated generation of contrastive explanations with three key factors: selectiveness, constrictiveness and responsibility. The results of a user study with 100 participants on the Amazon Mechanical Turk platform show that our generated contrastive explanations can help to increase users' understanding and trust of robotic planning policies, while reducing users' cognitive burden.
Shenghui Chen, Kayla Boggess, Lu Feng 0001
IROS2