arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.0120cs.LGcs.AI

Learning from Logged Implicit Exploration Data

Facebook(脸书);Yahoo!(雅虎);University of Pennsylvania(宾夕法尼亚大学)

Alex Strehl, John Langford, Sham Kakade, Lihong Li

英文摘要:

We provide a sound and consistent foundation for the use of \emph{nonrandom} exploration data in "contextual bandit" or "partially labeled" settings where only the value of a chosen action is learned. The primary challenge in a variety of settings is that the exploration policy, in which "offline" data is logged, is not explicitly known. Prior solutions here require either control of the actions during the learning process, recorded random exploration, or actions chosen obliviously in a repeated manner. The techniques reported here lift these restrictions, allowing the learning of a policy for choosing actions given features from historical data where no randomization occurred or was logged. We empirically verify our solution on two reasonably sized sets of real-world data obtained from Yahoo!.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑