Are We Really Achieving Better Beyond-Accuracy Performance in Next Basket Recommendation? (2405.01143v1)
Abstract: Next basket recommendation (NBR) is a special type of sequential recommendation that is increasingly receiving attention. So far, most NBR studies have focused on optimizing the accuracy of the recommendation, whereas optimizing for beyond-accuracy metrics, e.g., item fairness and diversity remains largely unexplored. Recent studies into NBR have found a substantial performance difference between recommending repeat items and explore items. Repeat items contribute most of the users' perceived accuracy compared with explore items. Informed by these findings, we identify a potential "short-cut" to optimize for beyond-accuracy metrics while maintaining high accuracy. To leverage and verify the existence of such short-cuts, we propose a plug-and-play two-step repetition-exploration (TREx) framework that treats repeat items and explores items separately, where we design a simple yet highly effective repetition module to ensure high accuracy, while two exploration modules target optimizing only beyond-accuracy metrics. Experiments are performed on two widely-used datasets w.r.t. a range of beyond-accuracy metrics, viz. five fairness metrics and three diversity metrics. Our experimental results verify the effectiveness of TREx. Prima facie, this appears to be good news: we can achieve high accuracy and improved beyond-accuracy metrics at the same time. However, we argue that the real-world value of our algorithmic solution, TREx, is likely to be limited and reflect on the reasonableness of the evaluation setup. We end up challenging existing evaluation paradigms, particularly in the context of beyond-accuracy metrics, and provide insights for researchers to navigate potential pitfalls and determine reasonable metrics to consider when optimizing for accuracy and beyond-accuracy metrics.
- ReCANet: A Repeat Consumption-Aware Neural Network for Next Basket Recommendation in Grocery Shopping. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 1240–1250.
- Complex Item Set Recommendation. In SIGIR 2023: 46th international ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 3444–3447.
- An Attribute-aware Neural Attentive Model for Next Basket recommendation. In The 41st International ACM SIGIR Conference on Research and Development in Information Retrieval. 1201–1204.
- Equity of attention: Amortizing individual fairness in rankings. In The 41st international ACM SIGIR conference on research & development in information retrieval. 405–414.
- Deepfair: Deep Learning for Improving Fairness in Recommender Systems. arXiv preprint arXiv:2006.05255 (2020).
- Controllable Multi-interest Framework for Recommendation. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2942–2951.
- Improving end-to-end sequential recommendations with intent-aware diversification. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 175–184.
- Multi-interest Diversification for End-to-end Sequential Recommendation. ACM Transactions on Information Systems 40, 1 (2021), 1–30.
- Modeling Dynamic Attributes for Next Basket Recommendation. arXiv preprint arXiv:2109.11654 (2021).
- Evaluating Stochastic Rankings with Expected Exposure. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 275–284.
- Fairness and Discrimination in Retrieval and Recommendation. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. 1403–1404.
- Recency Aware Collaborative Filtering for Next Basket Recommendation. In Proceedings of the 28th ACM Conference on User Modeling, Adaptation and Personalization. 80–87.
- Towards Long-Term Fairness in Recommendation. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. 445–453.
- Haoji Hu and Xiangnan He. 2019. Sets2Sets: Learning from Sequential Sets with Neural Networks. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1491–1499.
- Modeling Personalized Item Frequency Information for Next-basket Recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 1071–1080.
- Dietmar Jannach. 2022. Multi-Objective Recommender Systems: Survey and Challenges. In MORS workshop held in conjunction with the 16th ACM Conference on Recommender Systems (RecSys), 2022.
- Learning to Ride a Buy-Cycle: A Hyper-Convolutional Model for Next Basket Repurchase Recommendation. In Proceedings of the 16th ACM Conference on Recommender Systems. 316–326.
- Anuj Kumar and Kartik Hosanagar. 2019. Measuring the Value of Recommendation Links on Product Demand. Information Systems Research 30, 3 (2019), 819–838.
- Correlation-sensitive Next-basket Recommendation. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2808–2814.
- Recurrent Convolution Basket Map for Diversity Next-Basket Recommendation. In International Conference on Database Systems for Advanced Applications. 638–653.
- Masked and Swapped Sequence Modeling for Next Novel Basket Recommendation in Grocery Shopping. In Proceedings of the 17th ACM Conference on Recommender Systems. 35–46.
- Who Will Purchase this Item Next? Reverse Next Period Recommendation in Grocery Shopping. ACM Transactions on Recommender Systems 1, 2 (2023), 1–32.
- Repetition and Exploration in Offline Reinforcement Learning-based Recommendations. In 4th Workshop on Deep Reinforcement Learning for Information Retrieval at CIKM 2023. ACM.
- A next basket recommendation reality check. ACM Transactions on Information Systems 41, 4 (2023), 1–29.
- Repetition and Exploration in Sequential Recommendation. In SIGIR 2023: 46th international ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, 2532–2541.
- Fairness in recommendation: A survey. ACM Transactions on Intelligent Systems and Technology (2022).
- Enhancing Domain-level and User-level Adaptivity in Diversified Recommendation. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 747–756.
- Measuring Item Fairness in Next Basket Recommendation: A Reproducibility Study. In ECIR 2024: 46th European Conference on Information Retrieval. Springer, 210–225.
- Malte Ludewig and Dietmar Jannach. 2018. Evaluation of Session-based Recommendation Algorithms. User Modeling and User-Adapted Interaction 28 (2018), 331–390.
- Controlling Fairness and Bias in Dynamic Learning-to-Rank. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 429–438.
- CPFair: Personalized Consumer and Producer Fairness Re-Ranking for Recommender Systems. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 770–779.
- Time-Dependent Next-Basket Recommendations. In European Conference on Information Retrieval. Springer, 502–511.
- OECD. 2020. E-commerce in the Time of COVID-19. https://www.oecd.org/coronavirus/policy-responses/e-commerce-in-the-time-of-covid-19-3a2b78e8/.
- The World is Binary: Contrastive Learning for Denoising Next Basket Recommendation. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 859–868.
- Sequence-Aware Recommender Systems. Comput. Surveys 51, 4 (2018), 1–36.
- Amifa Raj and Michael D Ekstrand. 2022. Measuring fairness in ranked results: An analytical and empirical comparison. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 726–736.
- Factorizing Personalized Markov Chains for Next-basket Recommendation. In Proceedings of the 19th International Conference on World Wide Web. 811–820.
- Ashudeep Singh and Thorsten Joachims. 2018. Fairness of Exposure in Rankings. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2219–2228.
- Dual Sequential Network for Temporal Sets Prediction. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 1439–1448.
- Representing and Recommending Shopping Baskets with Complementarity, Compatibility and Loyalty. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 1133–1142.
- Learning Hierarchical Representation Model for Next Basket Recommendation. In Proceedings of the 38th International ACM SIGIR conference on Research and Development in Information Retrieval. 403–412.
- Modeling Temporal Dynamics of Users’ Purchase Behaviors for Next Basket Prediction. Journal of Computer Science and Technology 34, 6 (2019), 1230–1240.
- Modeling Multi-purpose Sessions for Next-item Recommendations via Mixture-channel Purpose Routing Networks. In International Joint Conference on Artificial Intelligence.
- Intention Nets: Psychology-inspired User Choice behavior Modeling for Next-basket Prediction. In Proceedings of the 34th AAAI Conference on Artificial Intelligence. 6259–6266.
- Emotions and Consumer Behavior. Journal of Consumer Research 40, 5 (2014), viii–xi.
- Joint Multisided Exposure Fairness for Recommendation. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 703–714.
- TFROM: A Two-Sided Fairness-Aware Recommendation Model for Both Customers and Providers. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1013–1022.
- Understanding Diversity in Session-Based Recommendation. ACM Transactions on Information Systems 42, 1 (2023), 1–34.
- A Dynamic Recurrent Model for Next Basket Recommendation. In Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval. 729–732.
- Predicting Temporal Sets with Deep Neural Networks. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1083–1091.
- Meike Zehlike and Carlos Castillo. 2020. Reducing Disparate Exposure in Ranking: A Learning To Rank Approach. In Proceedings of The Web Conference 2020. 2849–2855.
- Mi Zhang and Neil Hurley. 2008. Avoiding Monotony: Improving the Diversity of Recommendation Lists. In Proceedings of the 2008 ACM Conference on Recommender Systems. 123–130.
- Fairness and Diversity in Recommender Systems: A Survey. arXiv preprint arXiv:2307.04644 (2023).
- DGCN: Diversified Recommendation with Graph Convolutional Networks. In Proceedings of the Web Conference 2021. 401–412.