Greedy-Bayes for targeted news dissemination
2015 (English)In: Performance Evaluation Review, ACM Press, 2015, Vol. 43, no 1, 285-296 p.Conference paper (Refereed)Text
This work addresses user targeting for news content delivery. Specifically, we wish to disseminate a fresh news content, whose topic is yet unknown, to all interested users, while "spamming" a minimum number of uninterested users. We formulate this as an online stochastic optimization problem that extends in several ways the classical multi-armed bandit problem. We introduce Greedy-Bayes, a policy with appealing robustness properties. We establish optimal scaling of a suitably defined regret measure in various scenarios of interest. To that end we develop an original proof technique based on martingale concentration inequalities. Numerical experiments show that Greedy-Bayes improves upon Thompson sampling, the state-of-the-art algorithm for bandit problems. Our analysis further implies that low regret can only be achieved if the assessment of content relevance for one user leverages feedback from users with widely distinct tastes. This impacts the design of efficient news dissemination platforms: existing systems typically do not leverage such negative feedback and could hence be improved upon with adequate extensions.
Place, publisher, year, edition, pages
ACM Press, 2015. Vol. 43, no 1, 285-296 p.
Bayesian, Multi-armed bandit, Robust news delivery
IdentifiersURN: urn:nbn:se:kth:diva-187382DOI: 10.1145/2745844.2745868ScopusID: 2-s2.0-84955609516OAI: oai:DiVA.org:kth-187382DiVA: diva2:931369
ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2015; Portland; United States
QC 201605272016-05-272016-05-232016-05-27Bibliographically approved