Fetching the paper…
Reading the bibliography…
Multi-armed bandit problems are receiving a great deal of attention because they adequately formalize the exploration-exploitation trade-offs arising in several industrially relevant applications, such as online advertisement and, more generally, recommendation systems.
Using confidence bounds for exploration-exploitation trade-offs
P. Auer · 2002
Earlier work this paper cites.
Regularized multi–task learning
T. Evgeniou and M. Pontil · 2004
Earlier work this paper cites.
Kernels for multi–task learning
C. A. Micchelli and M. Pontil · 2004
Earlier work this paper cites.
Weighted graph cuts without eigenvectors a multilevel approach
I. S. Dhillon, Y. Guan, and B. Kulis · 2007
Earlier work this paper cites.
Personalized recommendation of social software items based on social relations
I. Guy, N. Zwerdling, D. Carmel, I. Ronen, E. Uziel, S. Yogev, and S. Ofek-Koifman · 2009
Earlier work this paper cites.
Feature hashing for large scale multitask learning
K. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg · 2009
Earlier work this paper cites.
Movie recommendation using random walks over the contextual graph
T. Bogers · 2010
Earlier work this paper cites.
Linear algorithms for online multitask classification
G. Cavallanti, N. Cesa-Bianchi, and C. Gentile · 2010
Earlier work this paper cites.
A contextual-bandit approach to personalized news article recommendation
L. Li, W. Chu, J. Langford, and R. E. Schapire · 2010
Cited alongside, same era.
How social relationships affect user similarities
A. Said, E. W. De Luca, and S. Albayrak · 2010
Cited alongside, same era.
Improved algorithms for linear stochastic bandits
Y. Abbasi-Yadkori, D. Pál, and C. Szepesvári · 2011
Cited alongside, same era.
Graphical models for bandit problems
K. Amin, M. Kearns, and U. Syed · 2011
Cited alongside, same era.
Algorithms and methods in recommender systems
D. Asanov · 2011
Cited alongside, same era.
2nd Workshop on Information Heterogeneity and Fusion in Recommender Systems (HetRec 2011)
I. Cantador, P. Brusilovsky, and T. Kuflik · 2011
Cited alongside, same era.
Bandit problems in networks: Asymptotically efficient distributed allocation rules
S. Kar, H. V. Poor, and S. Cui · 2011
Later among the works it cites.
From bandits to experts: On the value of side-observations
S. Mannor and O. Shamir · 2011
Later among the works it cites.
Contextual bandits with similarity information
A. Slivkins · 2011
Later among the works it cites.
Leveraging side observations in stochastic bandits
S. Caron, B. Kveton, M. Lelarge, and S. Bhagat · 2012
Later among the works it cites.
Multiclass classification with bandit feedback using adaptive regularization
K. Crammer and C. Gentile · 2013
Closest in time.
Multi-armed bandits in the presence of side observations in social networks
B. Swapna, A. Eryilmaz, and N. B. Shroff · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Contextual bandits with linear payoff functions
W. Chu, L. Li, L. Reyzin, and R. E. Schapire · 2011
Cited alongside, same era.
Gossip-based distributed stochastic bandit algorithms
B. Szörényi, R. Busa-Fekete, I. Hegedus, R. Ormándi, M. Jelasity, and B. Kégl · 2013
Closest in time.