图 书 馆
在部分监控的游戏中，Robust的可接近性和遗憾的最小化Robust approachability and regret minimization in games with partial monitoring |
|
| 课程网址: | http://videolectures.net/colt2011_perchet_robust/ |
| 主讲教师: | Vianney Perchet |
| 开课单位: | 匹兹堡大学医学中心 |
| 开课时间: | 2011-08-02 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Approachability has become a standard tool in analyzing learning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set, rather than being a single vector. Using this variant we tackle the problem of approachability in games with partial monitoring and develop simple and efficient algorithms (i.e., with constant per-step complexity) for this setup. We finally consider external and internal regret in repeated games with partial monitoring, for which we derive regretminimizing strategies based on approachability theory. |
| 关 键 词: | 对抗性的在线学习; 可接近性; 数学理论 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-08：heyf |
| 阅读次数: | 68 |