Improving Fictitious Play Reinforcement Learning with Expanding Models
Rong-Jun Qin, Jing-Cheng Pang, Yang Yu

TL;DR
This paper introduces a neural fictitious play method that expands a single model with sub-models and a selector, reducing forgetting and improving learning efficiency in zero-sum games.
Contribution
It proposes a novel model expansion approach with sub-models and a selector, addressing forgetting and sample efficiency issues in neural fictitious play.
Findings
Reduces forgetting in neural fictitious play.
Improves learning efficiency in zero-sum games.
Enhances robustness of the learning process.
Abstract
Fictitious play with reinforcement learning is a general and effective framework for zero-sum games. However, using the current deep neural network models, the implementation of fictitious play faces crucial challenges. Neural network model training employs gradient descent approaches to update all connection weights, and thus is easy to forget the old opponents after training to beat the new opponents. Existing approaches often maintain a pool of historical policy models to avoid the forgetting. However, learning to beat a pool in stochastic games, i.e., a wide distribution over policy models, is either sample-consuming or insufficient to exploit all models with limited amount of samples. In this paper, we propose a learning process with neural fictitious play to alleviate the above issues. We train a single model as our policy model, which consists of sub-models and a selector.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Reinforcement Learning in Robotics · Gambling Behavior and Treatments
