Pith. sign in

REVIEW 1 cited by

Collaborative AI Teaming in Unknown Environments via Active Goal Deduction

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 2403.15341 v1 pith:UWIKKTY6 submitted 2024-03-22 cs.AI cs.MA

classification cs.AIcs.MA
keywords agentsunknownteamingframeworkcollaborativeactivedeductionenvironments
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the advancements of artificial intelligence (AI), we're seeing more scenarios that require AI to work closely with other agents, whose goals and strategies might not be known beforehand. However, existing approaches for training collaborative agents often require defined and known reward signals and cannot address the problem of teaming with unknown agents that often have latent objectives/rewards. In response to this challenge, we propose teaming with unknown agents framework, which leverages kernel density Bayesian inverse learning method for active goal deduction and utilizes pre-trained, goal-conditioned policies to enable zero-shot policy adaptation. We prove that unbiased reward estimates in our framework are sufficient for optimal teaming with unknown agents. We further evaluate the framework of redesigned multi-agent particle and StarCraft II micromanagement environments with diverse unknown agents of different behaviors/rewards. Empirical results demonstrate that our framework significantly advances the teaming performance of AI and unknown agents in a wide range of collaborative scenarios.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks

    cs.AI 2025-02 reject novelty 5.0 of 10

    LiZero transfers Q-value estimates from similar past MDPs into a new UCT-style bound (aUCT), claiming 3 to 4 times faster convergence and about 31% higher early rewards on a sequence of grid-world tasks.

Pith tools