{"title":"Towards long-term depolarized interactive recommendations","authors":"Mohamed Lechiakh, Zakaria El-Moutaouakkil, Alexandre Maurer","doi":"10.1016/j.ipm.2024.103833","DOIUrl":null,"url":null,"abstract":"<div><p>Personalization is a prominent process in today’s recommender systems (RS) that enhances user satisfaction and platform profitability. However, recent studies suggest that over-personalization may lead to polarized user preferences, which can result in filter bubbles and echo-chamber effects. These effects have usually been mitigated by focusing on short-term recommendation goals using immediate polarization solutions in static RS settings. In this work, we explore the problem of long-term user polarization resulting from over-personalized multi-step interactive recommendations. We propose a framework to measure and limit the polarization of user preferences, based on item categories consumed over continuous <span><math><mrow><mi>T</mi><mo>−</mo></mrow></math></span>step recommendations. In this framework, we developed three recommendation approaches based on Deep Q-Networks (DQN), each one incorporating distinct polarization constraining and training techniques. First, we proposed I-CDQN, an instantaneously constrained DQN algorithm in which user polarization is forced to remain below a certain threshold at each recommendation step. Second, we proposed RP-DQN, a DQN-based method that incorporates polarization penalization terms into the reward and DQN loss function. Third, we introduced RC-DQN with a double DQN architecture, which constrains user polarization at the category-level using the first DQN, then trains the second unconstrained DQN using items from restricted category-related action spaces. The proposed methods differ in the way they apply polarization constraints, which can significantly impact their performance and suitability for specific application use cases. We conducted extensive experiments on real world datasets using cold- and warm-start scenarios for <span><math><mrow><mi>T</mi><mo>−</mo></mrow></math></span>step interactive recommendations. Interestingly, RC-DQN outperforms both I-CDQN and RP-DQN, demonstrating the best balance between user polarization and personalization, and achieving significant improvement in personalization results when compared to the best performing baseline methods across all experiments, e.g., about 3.6% for <span><math><mrow><mi>T</mi><mo>=</mo><mn>30</mn></mrow></math></span> steps.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324001924","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Personalization is a prominent process in today’s recommender systems (RS) that enhances user satisfaction and platform profitability. However, recent studies suggest that over-personalization may lead to polarized user preferences, which can result in filter bubbles and echo-chamber effects. These effects have usually been mitigated by focusing on short-term recommendation goals using immediate polarization solutions in static RS settings. In this work, we explore the problem of long-term user polarization resulting from over-personalized multi-step interactive recommendations. We propose a framework to measure and limit the polarization of user preferences, based on item categories consumed over continuous step recommendations. In this framework, we developed three recommendation approaches based on Deep Q-Networks (DQN), each one incorporating distinct polarization constraining and training techniques. First, we proposed I-CDQN, an instantaneously constrained DQN algorithm in which user polarization is forced to remain below a certain threshold at each recommendation step. Second, we proposed RP-DQN, a DQN-based method that incorporates polarization penalization terms into the reward and DQN loss function. Third, we introduced RC-DQN with a double DQN architecture, which constrains user polarization at the category-level using the first DQN, then trains the second unconstrained DQN using items from restricted category-related action spaces. The proposed methods differ in the way they apply polarization constraints, which can significantly impact their performance and suitability for specific application use cases. We conducted extensive experiments on real world datasets using cold- and warm-start scenarios for step interactive recommendations. Interestingly, RC-DQN outperforms both I-CDQN and RP-DQN, demonstrating the best balance between user polarization and personalization, and achieving significant improvement in personalization results when compared to the best performing baseline methods across all experiments, e.g., about 3.6% for steps.
期刊介绍:
Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing.
We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.