Counterfactual Learning-Driven Representation Disentanglement for Search-Enhanced Recommendation

• URL: http://arxiv.org/abs/2411.18631v1
• Date: Thu, 14 Nov 2024 09:51:50 GMT
• Title: Counterfactual Learning-Driven Representation Disentanglement for Search-Enhanced Recommendation
• Authors: Jiajun Cui, Xu Chen, Shuai Xiao, Chen Ju, Jinsong Lan, Qingwen Liu, Wei Zhang,
• Abstract summary: We propose a Counterfactual learning-driven representation disentanglement framework for search-enhanced recommendation. We leverage search queries to construct counterfactual signals to disentangle item representations, isolating only query-independent general features. Experiments on real datasets demonstrate ClardRec is effective in both collaborative filtering and sequential recommendation scenarios.
• Score: 19.76299850698492
• License:
• Abstract: For recommender systems in internet platforms, search activities provide additional insights into user interest through query-click interactions with items, and are thus widely used for enhancing personalized recommendation. However, these interacted items not only have transferable features matching users' interest helpful for the recommendation domain, but also have features related to users' unique intents in the search domain. Such domain gap of item features is neglected by most current search-enhanced recommendation methods. They directly incorporate these search behaviors into recommendation, and thus introduce partial negative transfer. To address this, we propose a Counterfactual learning-driven representation disentanglement framework for search-enhanced recommendation, based on the common belief that a user would click an item under a query not solely because of the item-query match but also due to the item's query-independent general features (e.g., color or style) that interest the user. These general features exclude the reflection of search-specific intents contained in queries, ensuring a pure match to users' underlying interest to complement recommendation. According to counterfactual thinking, how would user preferences and query match change for items if we removed their query-related features in search, we leverage search queries to construct counterfactual signals to disentangle item representations, isolating only query-independent general features. These representations subsequently enable feature augmentation and data augmentation for the recommendation scenario. Comprehensive experiments on real datasets demonstrate ClardRec is effective in both collaborative filtering and sequential recommendation scenarios.

Related papers

• Why Not Together? A Multiple-Round Recommender System for Queries and Items [37.709748983831034]
  A fundamental technique of recommender systems involves modeling user preferences, where queries and items are widely used as symbolic representations of user interests. We propose a novel approach named Multiple-round Auto Guess-and-Update System (MAGUS) that capitalizes on the synergies between both types.
  arXiv  Detail & Related papers  (2024-12-14T10:49:00Z)
• Enhancing CTR Prediction in Recommendation Domain with Search Query Representation [31.86615693808628]
  We propose a framework that learns from user search query embeddings within the context of user preferences in the recommendation domain. Specifically, user search query sequences from the search domain are used to predict the items users will click at the next time point in the recommendation domain.
  arXiv  Detail & Related papers  (2024-10-28T19:52:09Z)
• Beyond Positive History: Re-ranking with List-level Hybrid Feedback [49.52149227298746]
  We propose Re-ranking with List-level Hybrid Feedback (dubbed RELIFE) It captures user's preferences and behavior patterns with three modules. Experiments show that RELIFE significantly outperforms SOTA re-ranking baselines.
  arXiv  Detail & Related papers  (2024-10-28T06:39:01Z)
• ExcluIR: Exclusionary Neural Information Retrieval [74.08276741093317]
  We present ExcluIR, a set of resources for exclusionary retrieval. evaluation benchmark includes 3,452 high-quality exclusionary queries. training set contains 70,293 exclusionary queries, each paired with a positive document and a negative document.
  arXiv  Detail & Related papers  (2024-04-26T09:43:40Z)
• FineRec:Exploring Fine-grained Sequential Recommendation [28.27273649170967]
  We propose a novel framework that explores the attribute-opinion pairs of reviews to finely handle sequential recommendation. For each attribute, a unique attribute-specific user-opinion-item graph is created, where corresponding opinions serve as the edges linking heterogeneous user and item nodes. We present an interaction-driven fusion mechanism to integrate attribute-specific user/item representations across all attributes for generating recommendations.
  arXiv  Detail & Related papers  (2024-04-19T16:04:26Z)
• When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation [56.98380787425388]
  We propose a search-Enhanced framework for the Sequential Recommendation (SESRec) SESRec disentangling similar and dissimilar representations within S&R behaviors. Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-18T09:04:50Z)
• Recommender Systems with Generative Retrieval [58.454606442670034]
  We propose a novel generative retrieval approach, where the retrieval model autoregressively decodes the identifiers of the target candidates. To that end, we create semantically meaningful of codewords to serve as a Semantic ID for each item. We show that recommender systems trained with the proposed paradigm significantly outperform the current SOTA models on various datasets.
  arXiv  Detail & Related papers  (2023-05-08T21:48:17Z)
• Hierarchical Conversational Preference Elicitation with Bandit Feedback [36.507341041113825]
  We formulate a new conversational bandit problem that allows the recommender system to choose either a key-term or an item to recommend at each round. We conduct a survey and analyze a real-world dataset to find that, unlike assumptions made in prior works, key-term rewards are mainly affected by rewards of representative items. We propose two bandit algorithms, Hier-UCB and Hier-LinUCB, that leverage this observed relationship and the hierarchical structure between key-terms and items.
  arXiv  Detail & Related papers  (2022-09-06T05:35:24Z)
• Counterfactual Learning To Rank for Utility-Maximizing Query Autocompletion [40.31426350180036]
  We propose a new approach that explicitly optimize the query suggestions for downstream retrieval performance. We formulate this as a problem of ranking a set of rankings, where each query suggestion is represented by the downstream item ranking it produces. We then present a learning method that ranks query suggestions by the quality of their item rankings.
  arXiv  Detail & Related papers  (2022-04-22T21:40:51Z)
• The Stereotyping Problem in Collaboratively Filtered Recommender Systems [77.56225819389773]
  We show that matrix factorization-based collaborative filtering algorithms induce a kind of stereotyping. If preferences for a textitset of items are anti-correlated in the general user population, then those items may not be recommended together to a user. We propose an alternative modelling fix, which is designed to capture the diverse multiple interests of each user.
  arXiv  Detail & Related papers  (2021-06-23T18:37:47Z)
• Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation [59.183016033308014]
  In this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation. Our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches.
  arXiv  Detail & Related papers  (2021-05-16T08:06:22Z)

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.