Doubly Robust Policy Evaluation and Optimization

被引:149
作者
Dudik, Miroslav [1 ]
Erhan, Dumitru [2 ]
Langford, John [1 ]
Li, Lihong [3 ]
机构
[1] Microsoft Res, New York, NY 11728 USA
[2] Google Inc, Mountain View, CA USA
[3] Microsoft Res, Redmond, WA USA
关键词
Contextual bandits; doubly robust estimators; causal inference; REGRESSION ESTIMATION; INFERENCE; MODELS;
D O I
10.1214/14-STS500
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We study sequential decision making in environments where rewards are only partially observed, but can be modeled as a function of observed contexts and the chosen action by the decision maker. This setting, known as contextual bandits, encompasses a wide variety of applications such as health care, content recommendation and Internet advertising. A central task is evaluation of a new policy given historic data consisting of contexts, actions and received rewards. The key challenge is that the past data typically does not faithfully represent proportions of actions taken by a new policy. Previous approaches rely either on models of rewards or models of the past policy. The former are plagued by a large bias whereas the latter have a large variance. In this work, we leverage the strengths and overcome the weaknesses of the two approaches by applying the doubly robust estimation technique to the problems of policy evaluation and optimization. We prove that this approach yields accurate value estimates when we have either a good (but not necessarily consistent) model of rewards or a good (but not necessarily consistent) model of past policy. Extensive empirical comparison demonstrates that the doubly robust estimation uniformly improves over existing techniques, achieving both lower variance in value estimation and better policies. As such, we expect the doubly robust approach to become common practice in policy evaluation and optimization.
引用
收藏
页码:485 / 511
页数:27
相关论文
共 43 条
[1]   Content Recommendation on Web Portals [J].
Agarwal, Deepak ;
Chen, Bee-Chung ;
Elango, Pradheep ;
Ramakrishnan, Raghu .
COMMUNICATIONS OF THE ACM, 2013, 56 (06) :92-101
[2]  
[Anonymous], INT C MACH LEARN ICM
[3]  
[Anonymous], 2000, INT C MACH LEARN
[4]  
[Anonymous], 2007, Uci machine learning repository
[5]  
[Anonymous], 2010, P 16 ACM SIGKDD INT
[6]  
Auer P, 2003, SIAM J COMPUT, V32, P48, DOI 10.1137/S0097539701398375
[7]   PATTERN-RECOGNIZING STOCHASTIC LEARNING AUTOMATA [J].
BARTO, AG ;
ANANDAN, P .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1985, 15 (03) :360-375
[8]  
Beygelzimer A., 2011, Artificial Intelligence and Statistics (AISTATS), P19
[9]  
Beygelzimer A., 2008, MULTICLASS CLA UNPUB
[10]  
Beygelzimer A, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P129