CoCoB: Adaptive Collaborative Combinatorial Bandits for Online Recommendation

• URL: http://arxiv.org/abs/2505.03840v1
• Date: Mon, 05 May 2025 05:41:16 GMT
• Title: CoCoB: Adaptive Collaborative Combinatorial Bandits for Online Recommendation
• Authors: Cairong Yan, Jinyi Han, Jin Ju, Yanting Zhang, Zijian Wang, Xuan Shao,
• Abstract summary: This paper proposes an adaptive Collaborative Combinatorial Bandits algorithm (CoCoB)<n>CoCoB employs an innovative two-sided bandit architecture, applying bandit principles to both the user and item sides.<n>Experiments on three real-world datasets demonstrate CoCoB's effectiveness, achieving an average 2.4% improvement in F1 score over state-of-the-art methods.
• Score: 3.789330380841338
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Clustering bandits have gained significant attention in recommender systems by leveraging collaborative information from neighboring users to better capture target user preferences. However, these methods often lack a clear definition of similar users and face challenges when users with unique preferences lack appropriate neighbors. In such cases, relying on divergent preferences of misidentified neighbors can degrade recommendation quality. To address these limitations, this paper proposes an adaptive Collaborative Combinatorial Bandits algorithm (CoCoB). CoCoB employs an innovative two-sided bandit architecture, applying bandit principles to both the user and item sides. The user-bandit employs an enhanced Bayesian model to explore user similarity, identifying neighbors based on a similarity probability threshold. The item-bandit treats items as arms, generating diverse recommendations informed by the user-bandit's output. CoCoB dynamically adapts, leveraging neighbor preferences when available or focusing solely on the target user otherwise. Regret analysis under a linear contextual bandit setting and experiments on three real-world datasets demonstrate CoCoB's effectiveness, achieving an average 2.4% improvement in F1 score over state-of-the-art methods.

Related papers

• Search-Based Interaction For Conversation Recommendation via Generative Reward Model Based Simulated User [117.82681846559909]
  Conversational recommendation systems (CRSs) use multi-turn interaction to capture user preferences and provide personalized recommendations.<n>We propose a generative reward model based simulated user, named GRSU, for automatic interaction with CRSs.
  arXiv  Detail & Related papers  (2025-04-29T06:37:30Z)
• Empowering Retrieval-based Conversational Recommendation with Contrasting User Preferences [12.249992789091415]
  We propose a novel conversational recommender model, called COntrasting user pReference expAnsion and Learning (CORAL)<n>CORAL extracts the user's hidden preferences through contrasting preference expansion.<n>It explicitly differentiates the contrasting preferences and leverages them into the recommendation process via preference-aware learning.
  arXiv  Detail & Related papers  (2025-03-27T21:45:49Z)
• Interactive Visualization Recommendation with Hier-SUCB [52.11209329270573]
  We propose an interactive personalized visualization recommendation (PVisRec) system that learns on user feedback from previous interactions.<n>For more interactive and accurate recommendations, we propose Hier-SUCB, a contextual semi-bandit in the PVisRec setting.
  arXiv  Detail & Related papers  (2025-02-05T17:14:45Z)
• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback.<n>We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Quantifying User Coherence: A Unified Framework for Cross-Domain Recommendation Analysis [69.37718774071793]
  This paper introduces novel information-theoretic measures for understanding recommender systems. We evaluate 7 recommendation algorithms across 9 datasets, revealing the relationships between our measures and standard performance metrics.
  arXiv  Detail & Related papers  (2024-10-03T13:02:07Z)
• Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons [85.5955376526419]
  In rank aggregation problems, users exhibit various accuracy levels when comparing pairs of items. We propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons. We prove that our algorithm can return the true ranking of items with high probability.
  arXiv  Detail & Related papers  (2021-10-08T13:51:55Z)
• BanditMF: Multi-Armed Bandit Based Matrix Factorization Recommender System [0.0]
  Multi-armed bandits (MAB) provide a principled online learning approach to attain the balance between exploration and exploitation. collaborative filtering (CF) is arguably the earliest and most influential method in the recommender system. BanditMF is designed to address two challenges in the multi-armed bandits algorithm and collaborative filtering.
  arXiv  Detail & Related papers  (2021-06-21T07:35:39Z)
• When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution [36.76450390135742]
  Collaborative bandit algorithms utilize collaborative filtering techniques to improve sample efficiency in online interactive recommendation. All existing collaborative bandit learning solutions impose a stationary assumption about the environment. We develop a collaborative dynamic bandit solution to handle changing environment for recommendation.
  arXiv  Detail & Related papers  (2021-04-14T22:15:58Z)
• SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback [50.13745601531148]
  We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons. We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
  arXiv  Detail & Related papers  (2020-02-23T06:40:48Z)
• A Soft Recommender System for Social Networks [1.8275108630751844]
  Recent social recommender systems benefit from friendship graph to make an accurate recommendation. We went a step further to identify true friends for making even more realistic recommendations. We calculated the similarity between users, as well as the dependency between a user and an item.
  arXiv  Detail & Related papers  (2020-01-08T13:38:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.