This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
imperfect_information [2018/11/16 22:18]
imperfect_information [2018/12/29 12:47]
Line 204: Line 204:
 https://​arxiv.org/​abs/​1809.04040 Solving Imperfect-Information Games via Discounted Regret Minimization https://​arxiv.org/​abs/​1809.04040 Solving Imperfect-Information Games via Discounted Regret Minimization
-https://​arxiv.org/​abs/​1809.07893v1 ​+https://​arxiv.org/​abs/​1809.07893v1 ​Solving Large Extensive-Form Games with Strategy Constraints
 +In this work we introduce a generalized form of Counterfactual Regret Minimization that provably finds optimal strategies under any feasible set of convex constraints. ​
 +https://​arxiv.org/​abs/​1805.08195 Depth-Limited Solving for Imperfect-Information Games
 +Depth-Limited Solving for Imperfect-Information Games
 +Noam Brown, Tuomas Sandholm, Brandon Amos
 +(Submitted on 21 May 2018)
 +A fundamental challenge in imperfect-information games is that states do not have well-defined values. As a result, depth-limited search algorithms used in single-agent settings and perfect-information games do not apply. This paper introduces a principled way to conduct depth-limited solving in imperfect-information games by allowing the opponent to choose among a number of strategies for the remainder of the game at the depth limit. Each one of these strategies results in a different set of values for leaf nodes. This forces an agent to be robust to the different strategies an opponent may employ. We demonstrate the effectiveness of this approach by building a master-level heads-up no-limit Texas hold'​em poker AI that defeats two prior top agents using only a 4-core CPU and 16 GB of memory. Developing such a powerful agent would have previously required a supercomputer.
 +https://​arxiv.org/​abs/​1807.10299v1 Variational Option Discovery Algorithms
 +First: we highlight a tight connection between variational option discovery methods and variational autoencoders,​ and introduce Variational Autoencoding Learning of Options by Reinforcement (VALOR), a new method derived from the connection. In VALOR, the policy encodes contexts from a noise distribution into trajectories,​ and the decoder recovers the contexts from the complete trajectories. Second: we propose a curriculum learning approach where the number of contexts seen by the agent increases whenever the agent'​s performance is strong enough (as measured by the decoder) on the current set of contexts. We show that this simple trick stabilizes training for VALOR and prior variational option discovery methods, allowing a single agent to learn many more modes of behavior than it could with a fixed context distribution. Finally, we investigate other topics related to variational option discovery, including fundamental limitations of the general approach and the applicability of learned options to downstream tasks.