Demo Data from SIGIR 2026 / reviewers in the wild / expert
Mira Finkelstein
dblp:324/1172
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
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
2 papers |
Trustworthy machine learning · 60% Reinforcement learning · 40% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › interpretability
explainable AI |
0.6 | 1 | 2022 | Reinforcement Learning Explainability via Model Transforms (Student Abstract) · AAAI 2022 |
Machine learning › Trustworthy machine learning › interpretability
explainable reinforcement learning |
0.6 | 1 | 2022 | Explainable Reinforcement Learning via Model Transforms · NeurIPS 2022 |
Machine learning › Reinforcement learning
markov decision process |
0.6 | 1 | 2022 | Explainable Reinforcement Learning via Model Transforms · NeurIPS 2022 |
Machine learning › Reinforcement learning › markov decision process
MDP abstraction |
0.6 | 1 | 2022 | Explainable Reinforcement Learning via Model Transforms · NeurIPS 2022 |
Machine learning › Trustworthy machine learning › interpretability › explainable reinforcement learning
policy explanation |
0.6 | 1 | 2022 | Reinforcement Learning Explainability via Model Transforms (Student Abstract) · AAAI 2022 |
Methods — techniques the papers use, named apart from their topics
model transforms · 0.6formal MDP abstractions · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Reinforcement Learning Explainability via Model Transforms (Student Abstract)abstractUnderstanding the emerging behaviors of reinforcement learning agents may be difficult because such agents are often trained using highly complex and expressive models. In recent years, most approaches developed for explaining agent behaviors rely on domain knowledge or on an analysis of the agent’s learned policy. For some domains, relevant knowledge may not be available or may be insufficient for producing meaningful explanations. We suggest using formal model abstractions and transforms, previously used mainly for expediting the search for optimal policies, to automatically explain discrepancies that may arise between the behavior of an agent and the behavior that is anticipated by an observer. We formally define this problem of Reinforcement Learning Policy Explanation(RLPE), suggest a class of transforms which can be used for explaining emergent behaviors, and suggest meth-ods for searching efficiently for an explanation. We demonstrate the approach on standard benchmarks. Mira Finkelstein, Lucy Liu, Yoav Kolumbus, David C. Parkes, Jeffrey S. Rosenschein, Sarah Keren |
AAAI | 1 |
| 2022 | Explainable Reinforcement Learning via Model TransformsabstractUnderstanding emerging behaviors of reinforcement learning (RL) agents may be difficult since such agents are often trained in complex environments using highly complex decision making procedures. This has given rise to a variety of approaches to explainability in RL that aim to reconcile discrepancies that may arise between the behavior of an agent and the behavior that is anticipated by an observer. Most recent approaches have relied either on domain knowledge, that may not always be available, on an analysis of the agent’s policy, or on an analysis of specific elements of the underlying environment, typically modeled as a Markov Decision Process (MDP). Our key claim is that even if the underlying model is not fully known (e.g., the transition probabilities have not been accurately learned) or is not maintained by the agent (i.e., when using model-free methods), the model can nevertheless be exploited to automatically generate explanations. For this purpose, we suggest using formal MDP abstractions and transforms, previously used in the literature for expediting the search for optimal policies, to automatically produce explanations. Since such transforms are typically based on a symbolic representation of the environment, they can provide meaningful explanations for gaps between the anticipated and actual agent behavior. We formally define the explainability problem, suggest a class of transforms that can be used for explaining emergent behaviors, and suggest methods that enable efficient search for an explanation. We demonstrate the approach on a set of standard benchmarks. Mira Finkelstein, Nitsan Levy Schlot, Lucy Liu, Yoav Kolumbus, David C. Parkes, Jeffrey S. Rosenschein, Sarah Keren |
NeurIPS | 1 |