评“多武装土匪问题的有限时间分析”

2019 International Conference on Machine Learning and Cybernetics (ICMLC) Pub Date : 2019-07-01 DOI:10.1109/ICMLC48188.2019.8949232

Lu-ning Zhang, Xin Zuo, Jian-wei Liu, Weimin Li, Nobuyasu Ito

{"title":"评“多武装土匪问题的有限时间分析”","authors":"Lu-ning Zhang, Xin Zuo, Jian-wei Liu, Weimin Li, Nobuyasu Ito","doi":"10.1109/ICMLC48188.2019.8949232","DOIUrl":null,"url":null,"abstract":"In the article [1], we can get a tighter upper bound of expected regret in Theorem 1 and 4, there are also some critical incorrect statements in the proof of Theorem 2, we modified the incorrect statements in this comment and a correction version of Theorem 2 is also presented.","PeriodicalId":221349,"journal":{"name":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Comments on “Finite-Time Analysis of the Multiarmed Bandit Problem”\",\"authors\":\"Lu-ning Zhang, Xin Zuo, Jian-wei Liu, Weimin Li, Nobuyasu Ito\",\"doi\":\"10.1109/ICMLC48188.2019.8949232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the article [1], we can get a tighter upper bound of expected regret in Theorem 1 and 4, there are also some critical incorrect statements in the proof of Theorem 2, we modified the incorrect statements in this comment and a correction version of Theorem 2 is also presented.\",\"PeriodicalId\":221349,\"journal\":{\"name\":\"2019 International Conference on Machine Learning and Cybernetics (ICMLC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Machine Learning and Cybernetics (ICMLC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLC48188.2019.8949232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Machine Learning and Cybernetics (ICMLC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC48188.2019.8949232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在文章[1]中，我们可以在定理1和定理4中得到一个更严格的期望后悔上界，在定理2的证明中也有一些关键的错误表述，我们在这篇评论中对错误表述进行了修改，并给出了定理2的一个修正版本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Comments on “Finite-Time Analysis of the Multiarmed Bandit Problem”

In the article [1], we can get a tighter upper bound of expected regret in Theorem 1 and 4, there are also some critical incorrect statements in the proof of Theorem 2, we modified the incorrect statements in this comment and a correction version of Theorem 2 is also presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 International Conference on Machine Learning and Cybernetics (ICMLC)

自引率

0.00%

发文量