Pith. sign in

REVIEW

Towards Open Ad Hoc Teamwork Using Graph-based Policy 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 2006.10412 v4 pith:GOYJKLEY submitted 2020-06-18 cs.LG cs.MAstat.ML

classification cs.LGcs.MAstat.ML
keywords agentagentsmodelsprioraction-valueadaptcompositionsfixed
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Ad hoc teamwork is the challenging problem of designing an autonomous agent which can adapt quickly to collaborate with teammates without prior coordination mechanisms, including joint training. Prior work in this area has focused on closed teams in which the number of agents is fixed. In this work, we consider open teams by allowing agents with different fixed policies to enter and leave the environment without prior notification. Our solution builds on graph neural networks to learn agent models and joint-action value models under varying team compositions. We contribute a novel action-value computation that integrates the agent model and joint-action value model to produce action-value estimates. We empirically demonstrate that our approach successfully models the effects other agents have on the learner, leading to policies that robustly adapt to dynamic team compositions and significantly outperform several alternative methods.

Discussion (0). Continue with ORCID to comment.

Pith tools