Conditional Imitation Learning for Multi-Agent Games
summary
Proposes a conditional imitation framework that learns a latent low-rank subspace over ego and partner strategies and uses tensor decomposition to infer a new partner’s strategy from offline paired trajectories. Builds policies that interpolate in that subspace, tests on bandits, particle, Hanabi and an Overcooked user study with 50 humans, and reports better adaptation than meta, multitask and latent baselines. Finds partner behaviors fit a small basis (a rank 4 tensor explains the bandit data) and the adapted policy improves post-adaptation.
AI-written summary · about
chapters (6)
- 0:00Start
- 0:40The Goal of Our Work Is To Study the Framework of Coordinating with Different Partners
- 3:28Multi-Agent Imitation Learning Setup
- 7:10Collaborative Contextual Bandit Environment
- 8:32The Overcooked Environment
- 9:31Summary
related talks
28mPreference Learning from Minimal Human Feedback for Interactive
30mLearning Multi-Agent Collaborations With Decomposition
56mOf Moments and Matching: Trade-offs and Treatments in Imitation Learning
59mComplementarity and Delegation in Multi-Agent Models
15mSequential Decision Making Problems in Multi-Agent Environments
48mPractical Model-based Algorithms for Reinforcement Learning and Imitation Learning, with...
29mCombining Imitation + Reinforcement Learning to win the Bot Bowl competition
37mMultiagent Reinforcement Learning: Rollout and Policy Iteration
