3.4k citations · 9.9k across the 108 of their papers we have counts for
Showing 2014 · cs.AIShow all
2 papers · 2 filters
cs.AI2014★ 13 cited
On Minimax Optimal Offline Policy Evaluation
Lihong Li, Remi Munos, Csaba Szepesvari
This paper studies the off-policy evaluation problem, where one aims to estimate the value of a target policy based on a sample of observations collected by another policy. We firs…
cs.AI2014★ 178 cited
Bandit Algorithms for Tree Search
Pierre-Arnuad Coquelin, Remi Munos
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to re-…