Affiliation:
1. University of Illinois at Urbana–Champaign, USA
2. University of Illinois at Urbana?Champaign, USA
Abstract
We consider a generalized model of learning from expert advice in which experts could abstain from participating at some rounds. Our proposed online algorithm falls into the class of weighted average predictors and uses a time-varying multiplicative weight update rule. This update rule changes the weight of an expert based on his or her relative performance compared to the average performance of available experts at the current round. This makes the algorithm suitable for recommendation systems in the presence of an adversary with many potential applications in the new emerging area of the Internet of Things. We prove the convergence of our algorithm to the best expert, defined in terms of both availability and accuracy, in the stochastic setting. In particular, we show the applicability of our definition of best expert through convergence analysis of another well-known algorithm in this setting. Finally, through simulation results on synthetic and real datasets, we justify the out-performance of our proposed algorithms compared to the existing ones in the literature.
Publisher
Association for Computing Machinery (ACM)
Subject
Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications
Reference27 articles.
1. Does providing information to drivers reduce traffic congestion?
2. Predicting the Future with Social Media
3. Adaptive routing with end-to-end feedback
4. N. C. Bianchi and G. Lugosi. 2006. Prediction Learning and Games. Cambridge University Press Cambridge. N. C. Bianchi and G. Lugosi. 2006. Prediction Learning and Games. Cambridge University Press Cambridge.