0


权衡错误和未知的预测

Trading off Mistakes and Don't-Know Predictions
课程网址: http://videolectures.net/nips2010_blum_tom/  
主讲教师: Avrim Blum
开课单位: 卡内基梅隆大学
开课时间: 2011-03-25
课程语种: 英语
中文简介:
我们讨论了一个在线学习框架,其中允许代理人说“我不知道2以及对给定的例子做出错误的预测。我们分析说”我不知道“和犯错之间的权衡。如果不知道预测的数量被迫为零,模型简化为Littlestone [Lit88]引入的众所周知的错误约束模型。另一方面,如果不允许出错,则该模型简化为Li引入的KWIK框架et al。[LLW08]。我们为一般有限概念类提出了一种通用但效率低的算法,如果允许一定数量的错误,可以最小化不知道预测的数量。然后我们给出了特定的多项式时间算法。单调分离和线性分离器的概念类。
课程简介: We discuss an online learning framework in which the agent is allowed to say "I don't know2 as well as making incorrect predictions on given examples. We analyze the trade off between saying "I don't know" and making mistakes. If the number of don't know predictions is forced to be zero, the model reduces to the well-known mistake-bound model introduced by Littlestone [Lit88]. On the other hand, if no mistakes are allowed, the model reduces to KWIK framework introduced by Li et. al. [LLW08]. We propose a general, though inefficient, algorithm for general finite concept classes that minimizes the number of don't-know predictions if a certain number of mistakes are allowed. We then present specific polynomial-time algorithms for the concept classes of monotone disjunctions and linear separators.
关 键 词: 在线学习; 犯错; 错误约束模型
课程来源: 视频讲座网
最后编审: 2019-07-25:cwx
阅读次数: 45