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

Katherine E. Fitch

dblp:143/6035 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 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
1 paper
Reinforcement learning · 50% Trustworthy machine learning · 25% Optimization for machine learning · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › markov decision process › average-reward reinforcement learning
average reward
0.812024
Detecting Influence Structures in Multi-Agent Reinforcement Learning · ICML 2024
Machine learning › Optimization for machine learning
convergence guarantees
0.812024
Detecting Influence Structures in Multi-Agent Reinforcement Learning · ICML 2024
Machine learning › Trustworthy machine learning › Data-centric AI › data influence
influence estimation
0.812024
Detecting Influence Structures in Multi-Agent Reinforcement Learning · ICML 2024
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.812024
Detecting Influence Structures in Multi-Agent Reinforcement Learning · ICML 2024

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

decentralized learning · 0.8approximation algorithm · 0.8
YearPublicationVenuePosition
2024 Detecting Influence Structures in Multi-Agent Reinforcement Learning
abstract
We consider the problem of quantifying the amount of influence one agent can exert on another in the setting of multi-agent reinforcement learning (MARL). As a step towards a unified approach to express agents’ interdependencies, we introduce the total and state influence measurement functions. Both of these are valid for all common MARL systems, such as the discounted reward setting. Additionally, we propose novel quantities, called the total impact measurement (TIM) and state impact measurement (SIM), that characterize one agent’s influence on another by the maximum impact it can have on the other agents’ expected returns and represent instances of impact measurement functions in the average reward setting. Furthermore, we provide approximation algorithms for TIM and SIM with simultaneously learning approximations of agents’ expected returns, error bounds, stability analyses under changes of the policies, and convergence guarantees. The approximation algorithm relies only on observing other agents’ actions and is, other than that, fully decentralized. Through empirical studies, we validate our approach’s effectiveness in identifying intricate influence structures in complex interactions. Our work appears to be the first study of determining influence structures in the multi-agent average reward setting with convergence guarantees.
Fabian R. Pieroth, Katherine E. Fitch, Lenz Belzner
ICML2