dc.citation.conferencePlace |
US |
- |
dc.citation.conferencePlace |
Long Beach; United States |
- |
dc.citation.endPage |
5889 |
- |
dc.citation.startPage |
5875 |
- |
dc.citation.title |
36th International Conference on Machine Learning, ICML 2019 |
- |
dc.contributor.author |
Kim, Gi-Soo |
- |
dc.contributor.author |
Paik, Myunghee Cho |
- |
dc.date.accessioned |
2024-02-01T00:40:15Z |
- |
dc.date.available |
2024-02-01T00:40:15Z |
- |
dc.date.created |
2020-08-20 |
- |
dc.date.issued |
2019-06 |
- |
dc.description.abstract |
Contextual multi-armed bandit (MAB) algorithms have been shown promising for maximizing cumulative rewards in sequential decision tasks such as news article recommendation systems, web page ad placement algorithms, and mobile health. However, most of the proposed contextual MAB algorithms assume linear relationships between the reward and the context of the action. This paper proposes a new contextual MAB algorithm for a relaxed, semiparametric reward model that supports nonstationarity. The proposed method is less restrictive, easier to implement and faster than two alternative algorithms that consider the same model, while achieving a tight regret upper bound. We prove that the high-probability upper bound of the regret incurred by the proposed algorithm has the same order as the Thompson sampling algorithm for linear reward models. The proposed and existing algorithms are evaluated via simulation and also applied to Yahoo! News article recommendation log data. Copyright © 2019 ASME |
- |
dc.identifier.bibliographicCitation |
36th International Conference on Machine Learning, ICML 2019, pp.5875 - 5889 |
- |
dc.identifier.scopusid |
2-s2.0-85078284831 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/80250 |
- |
dc.language |
영어 |
- |
dc.publisher |
International Machine Learning Society (IMLS) |
- |
dc.title |
Contextual multi-armed bandit algorithm for semiparametric reward model |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2019-06-09 |
- |