%0 Generic %1 li2019cascading %A Li, Chang %A Feng, Haoyun %A de Rijke, Maarten %D 2019 %K bandits %R 10.1145/3383313.3412245 %T Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity %U http://arxiv.org/abs/1912.00508 %X Relevance ranking and result diversification are two core areas in modern recommender systems. Relevance ranking aims at building a ranked list sorted in decreasing order of item relevance, while result diversification focuses on generating a ranked list of items that covers a broad range of topics. In this paper, we study an online learning setting that aims to recommend a ranked list with $K$ items that maximizes the ranking utility, i.e., a list whose items are relevant and whose topics are diverse. We formulate it as the cascade hybrid bandits (CHB) problem. CHB assumes the cascading user behavior, where a user browses the displayed list from top to bottom, clicks the first attractive item, and stops browsing the rest. We propose a hybrid contextual bandit approach, called CascadeHybrid, for solving this problem. CascadeHybrid models item relevance and topical diversity using two independent functions and simultaneously learns those functions from user click feedback. We conduct experiments to evaluate CascadeHybrid on two real-world recommendation datasets: MovieLens and Yahoo music datasets. Our experimental results show that CascadeHybrid outperforms the baselines. In addition, we prove theoretical guarantees on the $n$-step performance demonstrating the soundness of CascadeHybrid.

@misc{li2019cascading, abstract = {Relevance ranking and result diversification are two core areas in modern recommender systems. Relevance ranking aims at building a ranked list sorted in decreasing order of item relevance, while result diversification focuses on generating a ranked list of items that covers a broad range of topics. In this paper, we study an online learning setting that aims to recommend a ranked list with $K$ items that maximizes the ranking utility, i.e., a list whose items are relevant and whose topics are diverse. We formulate it as the cascade hybrid bandits (CHB) problem. CHB assumes the cascading user behavior, where a user browses the displayed list from top to bottom, clicks the first attractive item, and stops browsing the rest. We propose a hybrid contextual bandit approach, called CascadeHybrid, for solving this problem. CascadeHybrid models item relevance and topical diversity using two independent functions and simultaneously learns those functions from user click feedback. We conduct experiments to evaluate CascadeHybrid on two real-world recommendation datasets: MovieLens and Yahoo music datasets. Our experimental results show that CascadeHybrid outperforms the baselines. In addition, we prove theoretical guarantees on the $n$-step performance demonstrating the soundness of CascadeHybrid.}, added-at = {2020-12-21T13:54:34.000+0100}, author = {Li, Chang and Feng, Haoyun and de Rijke, Maarten}, biburl = {https://www.bibsonomy.org/bibtex/2aad07acb5c867b7bf79628e64687b3a1/bibzou}, description = {Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity}, doi = {10.1145/3383313.3412245}, interhash = {c9a819ac7ffbf43b88a7231cef81be19}, intrahash = {aad07acb5c867b7bf79628e64687b3a1}, keywords = {bandits}, note = {cite arxiv:1912.00508}, timestamp = {2020-12-21T13:54:34.000+0100}, title = {Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity}, url = {http://arxiv.org/abs/1912.00508}, year = 2019 }