The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Collaborative Filtering Bandits
Open accessAbstract
Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation and computational advertisement, where the set of items and users is very fluid. In this work, we investigate an adaptive clustering technique for content recommendation based on exploration-exploitation strategies in contextual multi-armed bandit settings. Our algorithm takes into account the collaborative effects that arise due to the interaction of the users with the items, by dynamically grouping users based on the items under consideration and, at the same time, grouping items based on the similarity of the clusterings induced over the users. The resulting algorithm thus takes advantage of preference patterns in the data in a way akin to collaborative filtering methods. We provide an empirical analysis on medium-size real-world datasets, showing scalability and increased prediction performance (as measured by click-through rate) over state-of-the-art methods for clustering bandits. We also provide a regret analysis within a standard linear stochastic noise setting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772758 · Cited by 2,562
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Using confidence bounds for exploitation-exploration trade-offs
Auer, P. L. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944941 · Cited by 1,229
Information-theoretic co-clustering
Dhillon, I. S., Mallela, S., & Modha, D. S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956764 · Cited by 1,006
Improved Algorithms for Linear Stochastic Bandits
Abbasi-Yadkori, Y., Pál, D., & Szepesvári, C. (2011) · Cited by 919
Contextual Bandits with Linear Payoff Functions
Chu, W., Li, L. C., Reyzin, L., & Schapire, R. E. (2011) · Cited by 633
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 569
A Scalable Collaborative Filtering Framework Based on Co-Clustering
George, T., & Merugu, S. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.14 · Cited by 407
Contextual Gaussian Process Bandit Optimization
Krause, A., & Ong, C. S. (2011) · Cited by 267
Modelling Relational Data using Bayesian Clustered Tensor Factorization
Sutskever, I., Salakhutdinov, R., & Tenenbaum, J. B. (2009) · Cited by 229
High-Dimensional Gaussian Process Bandits
Djolonga, J., Krause, A., & Cevher, V. (2013) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 116
Efficient Thompson sampling for online matrix-factorization recommendation
Kawale, J., Bui, H., Kveton, B., Thanh, L. T., & Chawla, S. (2015) · ePrints Soton (University of Southampton) · doi:10.5555/2969239.2969384 · Cited by 115
Multiclass classification with bandit feedback using adaptive regularization
Crammer, K., & Gentile, C. (2012) · Machine Learning · doi:10.1007/s10994-012-5321-8 · Cited by 109
Self-citationSample Complexity of Multi-task Reinforcement LearningPreprint
Brunskill, E., & Li, L. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.6821 · Cited by 106
Unifying nearest neighbors collaborative filtering
Verstrepen, K., & Goethals, B. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645731 · Cited by 100
Ensemble contextual bandits for personalized recommendation
Tang, L., Jiang, Y., Li, L., & Li, T. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645732 · Cited by 100
Personalized Recommendation via Parameter-Free Contextual Bandits
Tang, L., Jiang, Y., Li, L., Zeng, C., & Li, T. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767707 · Cited by 79
Hao, F., Li, S., Min, G., Kim, H., Yau, S. S., & Yang, L. T. (2015) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2015.2401833 · Cited by 74
Self-citationDynamic Clustering of Contextual Multi-Armed Bandits
Nguyen, T. T., & Lauw, H. W. (2014) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2661829.2662063 · Cited by 62
Sequential Transfer in Multi-armed Bandit with Finite Set of ModelsPreprint
Azar, M. G., Lazaric, A., & Brunskill, E. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.6887 · Cited by 60
Maillard, O.-A., & Mannor, S. (2014) · International Conference on Machine Learning · Cited by 44
PAC-Bayesian Analysis of Contextual Bandits
Seldin, Y., Auer, P. L., Laviolette, F., et al. (2011) · MPG.PuRe (Max Planck Society) · Cited by 38
Medicine Rating Prediction and Recommendation in Mobile Social Networks
Li, S., Hao, F., Li, M., & Kim, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38027-3_23 · Cited by 24
Self-citationA Latent Source Model for Online Collaborative FilteringPreprint
Bresler, G., Chen, G. H., & Shah, D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.6591 · Cited by 20
Cited by
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
Reinforcement Learning based Recommender Systems: A Survey
Afsar, M. M., Crump, T., & Far, B. (2023) · ACM Computing Surveys · doi:10.1145/3543846 · Cited by 502
Rana, N., Latiff, M. S. A., Abdulhamid, S. M., & Chiroma, H. (2020) · Neural Computing and Applications · doi:10.1007/s00521-020-04849-z · Cited by 357
Lei, W., He, X., Miao, Y., Wu, Q., Hong, R., Kan, M.-Y., & Chua, T.-S. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371769 · Cited by 253
Panel Experiments and Dynamic Causal Effects: A Finite Population Perspective
Bojinov, I., Rambachan, A., & Shephard, N. (2021) · Quantitative Economics · doi:10.3982/qe1744 · Cited by 60
Metadata
- Authors
- Li, S., Karatzoglou, A., & Gentile, C.
- Venue
- Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2016-07-07
- Pages
- 539-548
- OpenAlex
- W2962818688
- Cited by
- 287
- References
- 25
- FWCI
- 44.56
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.