Repeat-bias-aware Optimization of Beyond-accuracy Metrics for Next Basket Recommendation

• URL: http://arxiv.org/abs/2501.06362v1
• Date: Fri, 10 Jan 2025 21:58:34 GMT
• Title: Repeat-bias-aware Optimization of Beyond-accuracy Metrics for Next Basket Recommendation
• Authors: Yuanna Liu, Ming Li, Mohammad Aliannejadi, Maarten de Rijke,
• Abstract summary: In next basket recommendation (NBR) a set of items is recommended to users based on their historical basket sequences. Some state-of-the-art NBR methods are heavily biased to recommend repeat items so as to maximize utility. We find that only optimizing diversity or item fairness without considering repeat bias may cause NBR algorithms to recommend more repeat items.
• Score: 54.5376993040561
• License:
• Abstract: In next basket recommendation (NBR) a set of items is recommended to users based on their historical basket sequences. In many domains, the recommended baskets consist of both repeat items and explore items. Some state-of-the-art NBR methods are heavily biased to recommend repeat items so as to maximize utility. The evaluation and optimization of beyond-accuracy objectives for NBR, such as item fairness and diversity, has attracted increasing attention. How can such beyond-accuracy objectives be pursued in the presence of heavy repeat bias? We find that only optimizing diversity or item fairness without considering repeat bias may cause NBR algorithms to recommend more repeat items. To solve this problem, we propose a model-agnostic repeat-bias-aware optimization algorithm to post-process the recommended results obtained from NBR methods with the objective of mitigating repeat bias when optimizing diversity or item fairness. We consider multiple variations of our optimization algorithm to cater to multiple NBR methods. Experiments on three real-world grocery shopping datasets show that the proposed algorithms can effectively improve diversity and item fairness, and mitigate repeat bias at acceptable Recall loss.

Related papers

• Calibrating the Predictions for Top-N Recommendations [3.176387928678296]
  We show that previous calibration methods result in miscalibrated predictions for the top-N items. We propose a generic method to optimize calibration models focusing on the top-N items.
  arXiv  Detail & Related papers  (2024-08-21T13:06:28Z)
• Are We Really Achieving Better Beyond-Accuracy Performance in Next Basket Recommendation? [57.91114305844153]
  Next basket recommendation (NBR) is a special type of sequential recommendation that is increasingly receiving attention. Recent studies into NBR have found a substantial performance difference between recommending repeat items and explore items. We propose a plug-and-play two-step repetition-exploration framework that treats repeat items and explores items separately.
  arXiv  Detail & Related papers  (2024-05-02T09:59:35Z)
• Masked and Swapped Sequence Modeling for Next Novel Basket Recommendation in Grocery Shopping [59.52585406731807]
  Next basket recommendation (NBR) is the task of predicting the next set of items based on a sequence of already purchased baskets. We formulate the next novel basket recommendation (NNBR) task, i.e., the task of recommending a basket that only consists of novel items.
  arXiv  Detail & Related papers  (2023-08-02T17:52:37Z)
• Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
  We show how to return a set of items rigorously guaranteed to contain mostly good items. Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate. We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
  arXiv  Detail & Related papers  (2022-07-04T17:49:25Z)
• Determinantal Point Process Likelihoods for Sequential Recommendation [12.206748373325972]
  We propose two new loss functions based on the Determinantal Point Process (DPP) likelihood, that can be adaptively applied to estimate the subsequent item or items. Experimental results using the proposed loss functions on three real-world datasets show marked improvements over state-of-the-art sequential recommendation methods in both quality and diversity metrics.
  arXiv  Detail & Related papers  (2022-04-25T11:20:10Z)
• A Next Basket Recommendation Reality Check [48.29308926607474]
  The goal of a next basket recommendation (NBR) system is to recommend items for the next basket for a user, based on the sequence of their prior baskets. We provide a novel angle on the evaluation of next basket recommendation methods, centered on the distinction between repetition and exploration. We propose a set of metrics that measure the repeat/explore ratio and performance of NBR models.
  arXiv  Detail & Related papers  (2021-09-29T07:14:22Z)
• Using Stable Matching to Optimize the Balance between Accuracy and Diversity in Recommendation [3.0938904602244355]
  Increasing aggregate diversity (or catalog coverage) is an important system-level objective in many recommendation domains. Attempts to increase aggregate diversity often result in lower recommendation accuracy for end users. We propose a two-sided post-processing approach in which both user and item utilities are considered.
  arXiv  Detail & Related papers  (2020-06-05T22:12:25Z)
• 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)

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.