A gang of bandits

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Cesa Bianchi, Nicolò ^a   Gentile, Claudio ^b   Zappella, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPROACH; EXPLORATION EXPLOITATIONS; MULTI-ARMED BANDIT PROBLEM; ONLINE ADVERTISEMENTS; PREDICTION PERFORMANCE; RECOMMENDATION STRATEGIES; SOCIAL RELATIONSHIPS; STATE-OF-THE-ART METHODS;

ALGORITHMS;

EID: 84899007415     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Y. Abbasi-Yadkori, D. Pál, and C. Szepesvári. Improved algorithms for linear stochastic bandits. Advances in Neural Information Processing Systems, 2011.
2. K. Amin, M. Kearns, and U. Syed. Graphical models for bandit problems. Proceedings of the Twenty-Seventh Conference Uncertainty in Artificial Intelligence, 2011.
3. D. Asanov. Algorithms and methods in recommender systems. Berlin Institute of Technology, Berlin, Germany, 2011.
4. P. Auer. Using confidence bounds for exploration-exploitation trade-offs. Journal of Machine Learning Research, 3:397-422, 2002.
5. T. Bogers. Movie recommendation using random walks over the contextual graph. In CARS'10: Proceedings of the 2nd Workshop on Context-Aware Recommender Systems, 2010.
6. I. Cantador, P. Brusilovsky, and T. Kuflik. 2nd Workshop on Information Heterogeneity and Fusion in Recommender Systems (HetRec 2011). In Proceedings of the 5th ACM Conference on Recommender Systems, RecSys 2011. ACM, 2011.
7. S. Caron, B. Kveton, M. Lelarge, and S. Bhagat. Leveraging side observations in stochastic bandits. In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, pages 142-151, 2012.
8. G. Cavallanti, N. Cesa-Bianchi, and C. Gentile. Linear algorithms for online multitask classification. Journal of Machine Learning Research, 11:2597-2630, 2010.
9. W. Chu, L. Li, L. Reyzin, and R. E. Schapire. Contextual bandits with linear payoff functions. In Proceedings of the International Conference on Artificial Intelligence and Statistics, pages 208-214, 2011.
10. K. Crammer and C. Gentile. Multiclass classification with bandit feedback using adaptive regularization. Machine Learning, 90(3):347-383, 2013.
11. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors a multilevel approach. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 29(11):1944-1957, 2007.
12. T. Evgeniou and M. Pontil. Regularized multi-task learning. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '04, pages 109-117, New York, NY, USA, 2004. ACM.
13. I. Guy, N. Zwerdling, D. Carmel, I. Ronen, E. Uziel, S. Yogev, and S. Ofek-Koifman. Personalized recommendation of social software items based on social relations. In Proceedings of the Third ACM Conference on Recommender Sarxiv ystems, pages 53-60. ACM, 2009.
14. S. Kar, H. V. Poor, and S. Cui. Bandit problems in networks: Asymptotically efficient distributed allocation rules. In Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on, pages 1771-1778. IEEE, 2011.
15. L. Li, W. Chu, J. Langford, and R. E. Schapire. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th International Conference on World Wide Web, pages 661-670. ACM, 2010.
16. S. Mannor and O. Shamir. From bandits to experts: On the value of side-observations. In Advances in Neural Information Processing Systems, pages 684-692, 2011.
17. C. A. Micchelli and M. Pontil. Kernels for multi-task learning. In Advances in Neural Information Processing Systems, pages 921-928, 2004.
18. A. Said, E.W. De Luca, and S. Albayrak. How social relationships affect user similarities. In Proceedings of the 2010 Workshop on Social Recommender Systems, pages 1-4, 2010.
19. A. Slivkins. Contextual bandits with similarity information. Journal of Machine Learning Research-Proceedings Track, 19:679-702, 2011.
20. B. Swapna, A. Eryilmaz, and N. B. Shroff. Multi-armed bandits in the presence of side observations in social networks. In Proceedings of 52nd IEEE Conference on Decision and Control (CDC), 2013.
21. B. Szörényi, R. Busa-Fekete, I. Hegedus, R. Ormándi, M. Jelasity, and B. Kégl. Gossip-based distributed stochastic bandit algorithms. Proceedings of the 30th International Conference on Machine Learning, 2013.
22. K. Weinberger, A. Dasgupta, J. Langford, A. Smola, and J. Attenberg. Feature hashing for large scale multitask learning. In Proceedings of the 26th International Conference on Machine Learning, pages 1113-1120. Omnipress, 2009.