Skip to main content

Reducing Exploration of Dying Arms in Mortal Bandits

Publication ,  Conference
Tracà, S; Rudin, C; Yan, W
Published in: Proceedings of Machine Learning Research
January 1, 2019

Mortal bandits have proven to be extremely useful for providing news article recommendations, running automated online advertising campaigns, and for other applications where the set of available options changes over time. Previous work on this problem showed how to regulate exploration of new arms when they have recently appeared, but they do not adapt when the arms are about to disappear. Since in most applications we can determine either exactly or approximately when arms will disappear, we can leverage this information to improve performance: we should not be exploring arms that are about to disappear. We provide adaptations of algorithms, regret bounds, and experiments for this study, showing a clear benefit from regulating greed (exploration/exploitation) for arms that will soon disappear. We illustrate numerical performance on the Yahoo! Front Page Today Module User Click Log Dataset.

Duke Scholars

Published In

Proceedings of Machine Learning Research

EISSN

2640-3498

Publication Date

January 1, 2019

Volume

115

Start / End Page

156 / 163
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Tracà, S., Rudin, C., & Yan, W. (2019). Reducing Exploration of Dying Arms in Mortal Bandits. In Proceedings of Machine Learning Research (Vol. 115, pp. 156–163).
Tracà, S., C. Rudin, and W. Yan. “Reducing Exploration of Dying Arms in Mortal Bandits.” In Proceedings of Machine Learning Research, 115:156–63, 2019.
Tracà S, Rudin C, Yan W. Reducing Exploration of Dying Arms in Mortal Bandits. In: Proceedings of Machine Learning Research. 2019. p. 156–63.
Tracà, S., et al. “Reducing Exploration of Dying Arms in Mortal Bandits.” Proceedings of Machine Learning Research, vol. 115, 2019, pp. 156–63.
Tracà S, Rudin C, Yan W. Reducing Exploration of Dying Arms in Mortal Bandits. Proceedings of Machine Learning Research. 2019. p. 156–163.

Published In

Proceedings of Machine Learning Research

EISSN

2640-3498

Publication Date

January 1, 2019

Volume

115

Start / End Page

156 / 163