3.4k citations · 4.9k across the 135 of their papers we have counts for
Showing 2021 · stat.MLShow all
2 papers · 2 filters
stat.ML2021★ 2 cited
Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recall
Tadashi Kozuno, Pierre Ménard, Rémi Munos +1
We study the problem of learning a Nash equilibrium (NE) in an imperfect information game (IIG) through self-play. Precisely, we focus on two-player, zero-sum, episodic, tabular II…
stat.ML2021★ 10 cited
UCB Momentum Q-learning: Correcting the bias without forgetting
Pierre Menard, Omar Darwiche Domingues, Xuedong Shang +1
We propose UCBMQ, Upper Confidence Bound Momentum Q-learning, a new algorithm for reinforcement learning in tabular and possibly stage-dependent, episodic Markov decision process.…