pith. sign in

arxiv: 1910.05512 · v1 · pith:KNV2I6SCnew · submitted 2019-10-12 · 💻 cs.LG · cs.MA· stat.ML

Influence-Based Multi-Agent Exploration

classification 💻 cs.LG cs.MAstat.ML
keywords explorationinfluenceagentsedtieitimulti-agentcoordinatedinteraction
0
0 comments X
read the original abstract

Intrinsically motivated reinforcement learning aims to address the exploration challenge for sparse-reward tasks. However, the study of exploration methods in transition-dependent multi-agent settings is largely absent from the literature. We aim to take a step towards solving this problem. We present two exploration methods: exploration via information-theoretic influence (EITI) and exploration via decision-theoretic influence (EDTI), by exploiting the role of interaction in coordinated behaviors of agents. EITI uses mutual information to capture influence transition dynamics. EDTI uses a novel intrinsic reward, called Value of Interaction (VoI), to characterize and quantify the influence of one agent's behavior on expected returns of other agents. By optimizing EITI or EDTI objective as a regularizer, agents are encouraged to coordinate their exploration and learn policies to optimize team performance. We show how to optimize these regularizers so that they can be easily integrated with policy gradient reinforcement learning. The resulting update rule draws a connection between coordinated exploration and intrinsic reward distribution. Finally, we empirically demonstrate the significant strength of our method in a variety of multi-agent scenarios.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimistic {\epsilon}-Greedy Exploration for Cooperative Multi-Agent Reinforcement Learning

    cs.MA 2025-02 unverdicted novelty 6.0

    Optimistic ε-Greedy Exploration adds decoupled optimistic networks that converge in probability to maximum returns and samples from them with probability ε to increase optimal joint-action frequency in CTDE MARL.

  2. Centralized Adaptive Sampling for Reliable Co-Training of Independent Multi-Agent Policies

    cs.LG 2025-08 unverdicted novelty 5.0

    CoSER adaptively samples joint actions in CTDE MARL to reduce sampling error relative to the joint on-policy distribution, empirically improving reliability of independent policy gradient convergence.