Pith. sign in

REVIEW 2 cited by

Agent-Temporal Attention for Reward Redistribution in Episodic Multi-Agent Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.04612 v1 pith:7GOVFDXB submitted 2022-01-12 cs.MA cs.AIcs.LG

classification cs.MAcs.AIcs.LG
keywords rewardarelagentsattentionmulti-agentredistributionalongepisodic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper considers multi-agent reinforcement learning (MARL) tasks where agents receive a shared global reward at the end of an episode. The delayed nature of this reward affects the ability of the agents to assess the quality of their actions at intermediate time-steps. This paper focuses on developing methods to learn a temporal redistribution of the episodic reward to obtain a dense reward signal. Solving such MARL problems requires addressing two challenges: identifying (1) relative importance of states along the length of an episode (along time), and (2) relative importance of individual agents' states at any single time-step (among agents). In this paper, we introduce Agent-Temporal Attention for Reward Redistribution in Episodic Multi-Agent Reinforcement Learning (AREL) to address these two challenges. AREL uses attention mechanisms to characterize the influence of actions on state transitions along trajectories (temporal attention), and how each agent is affected by other agents at each time-step (agent attention). The redistributed rewards predicted by AREL are dense, and can be integrated with any given MARL algorithm. We evaluate AREL on challenging tasks from the Particle World environment and the StarCraft Multi-Agent Challenge. AREL results in higher rewards in Particle World, and improved win rates in StarCraft compared to three state-of-the-art reward redistribution methods. Our code is available at https://github.com/baicenxiao/AREL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Latent Reward: LLM-Empowered Credit Assignment in Episodic Reinforcement Learning

    cs.LG 2024-12 conditional novelty 6.0 of 10

    LLM-generated code produces compact multi-dimensional latent rewards that improve temporal and multi-agent credit assignment in episodic reinforcement learning, outperforming standard return-decomposition baselines an...

  2. Agent-Temporal Credit Assignment for Optimal Policy Preservation in Sparse Multi-Agent Reinforcement Learning

    cs.MA 2024-12 reject novelty 4.0 of 10

    TAR2 redistributes sparse multi-agent rewards both across time and across agents, but its optimal-policy-preservation proof depends on a trajectory-dependent 'potential' and is not valid.

Pith tools