2016 · 137 citations · 26 references
ComputingData ScienceMarkov Decision ProcessesOptimizationRecommender SystemsContext-aware RecommendationOnline RecommendationReinforcement LearningReinforcement Learning FoundationsBandit AlgorithmsBandit Algorithms For RecommendationContextContextual Bandit RecommendationContextual BanditsExploration - Exploitation Trade-offMulti-armed Bandit OptimizationMulti-armed Bandit Recommendation
Contextual multi-armed bandit problems have gained increasing popularity and attention in recent years due to their capability of leveraging contextual information to deliver online personalized recommendation services (e.g., online advertising and news article selection). To predict the reward of each arm given a particular context, existing relevant research studies for contextual multi-armed bandit problems often assume the existence of a fixed yet unknown reward mapping function. However, this assumption rarely holds in practice, since real-world problems often involve underlying processes that are dynamically evolving over time.
26
Proceedings of the 24th international conference on Machine learning
2007 · 11.7K citations
Forecasting, Structural Time Series Models and the Kalman Filter
Robert Fildes, Andrew Harvey, Mike West et al. · Journal of the Operational Research Society · 1991 · 4.8K citations
Computing, Mathematics, Forecasting +13
A contextual-bandit approach to personalized news article recommendation
Lihong Li, Wei Chu, John Langford et al. · 2010 · 2.5K citations · Full text
The Nonstochastic Multiarmed Bandit Problem
Peter Auer, Nicolò Cesa‐Bianchi, Yoav Freund et al. · SIAM Journal on Computing · 2002 · 2.3K citations