0


组合预测对策

Combinatorial prediction games
课程网址: http://videolectures.net/nipsworkshops2011_cesa_bianchi_games/  
主讲教师: Nicolò Cesa-Bianchi
开课单位: 米兰大学
开课时间: 2012-01-25
课程语种: 英语
中文简介:
组合预测游戏是在线线性优化的问题,其中动作空间是组合空间。这些游戏可以在不同的反馈模型下进行研究:全部,半强盗和土匪。在演讲的第一部分,我们将描述有关这些模型的主要已知事实,并提及一些未解决的问题。在第二部分中,我们将重点关注强盗反馈并描述一些最近的结果,这些结果加强了强盗优化和凸几何之间的联系。
课程简介: Combinatorial prediction games are problems of online linear optimization in which the action space is a combinatorial space. These games can be studied under different feedback models: full, semi-bandit, and bandit. In first part of the talk we will describe the main known facts about these models and mention some of the open problems. In the second part we will focus on the bandit feedback and describe some recent results which strengthen the link between bandit optimization and convex geometry.
关 键 词: 线性优化; 反馈模型; 强盗反馈
课程来源: 视频讲座网
最后编审: 2019-09-07:lxf
阅读次数: 34