arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.02206cs.LGstat.ML

Learning to Search Better Than Your Teacher

University of Illinois at Urbana Champaign(伊利诺伊大学厄巴纳-香槟分校);Carnegie Mellon University(卡内基梅隆大学);Microsoft Research(微软研究院);University of Maryland, College Park(马里兰大学帕克分校)

Kai-Wei Chang, Akshay Krishnamurthy, Alekh Agarwal, Hal Daumé, John Langford

英文摘要:

Methods for learning to search for structured prediction typically imitate a reference policy, with existing theoretical guarantees demonstrating low regret compared to that reference. This is unsatisfactory in many applications where the reference policy is suboptimal and the goal of learning is to improve upon it. Can learning to search work even when the reference is poor? We provide a new learning to search algorithm, LOLS, which does well relative to the reference policy, but additionally guarantees low regret compared to deviations from the learned policy: a local-optimality guarantee. Consequently, LOLS can improve upon the reference policy, unlike previous algorithms. This enables us to develop structured contextual bandits, a partial information structured prediction setting with many potential applications.

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

↑