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.
Collaborative AI Teaming in Unknown Environments via Active Goal Deduction
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Lipschitz Lifelong Monte Carlo Tree Search for Mastering Non-Stationary Tasks
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.