Understanding or Manipulation: Rethinking Online Performance Gains of Modern Recommender Systems

Author:

Zhu Zhengbang1,Qin Rongjun2,Huang Junjie1,Dai Xinyi1,Yu Yang2,Yu Yong1,Zhang Weinan1

Affiliation:

1. Shanghai Jiao Tong University, China

2. National Key Laboratory for Novel Software Technology, Nanjing University, China and Polixir Technologies, China

Abstract

Recommender systems are expected to be assistants that help human users find relevant information automatically without explicit queries. As recommender systems evolve, increasingly sophisticated learning techniques are applied and have achieved better performance in terms of user engagement metrics such as clicks and browsing time. The increase in the measured performance, however, can have two possible attributions: a better understanding of user preferences, and a more proactive ability to utilize human bounded rationality to seduce user over-consumption. A natural following question is whether current recommendation algorithms are manipulating user preferences. If so, can we measure the manipulation level? In this paper, we present a general framework for benchmarking the degree of manipulations of recommendation algorithms, in both slate recommendation and sequential recommendation scenarios. The framework consists of four stages, initial preference calculation, training data collection, algorithm training and interaction, and metrics calculation that involves two proposed metrics, Manipulation Score and Preference Shift. We benchmark some representative recommendation algorithms in both synthetic and real-world datasets under the proposed framework. We have observed that a high online click-through rate does not necessarily mean a better understanding of user initial preference, but ends in prompting users to choose more documents they initially did not favor. Moreover, we find that the training data have notable impacts on the manipulation degrees, and algorithms with more powerful modeling abilities are more sensitive to such impacts. The experiments also verified the usefulness of the proposed metrics for measuring the degree of manipulations. We advocate that future recommendation algorithm studies should be treated as an optimization problem with constrained user preference manipulations.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Reference102 articles.

1. Effects of Online Recommendations on Consumers’ Willingness to Pay

2. Learning a Deep Listwise Context Model for Ranking Refinement

3. Anchoring and cognitive ability

4. Lucas Bernardi Sakshi Batra and Cintia Alicia Bruscantini. 2021. Simulations in Recommender Systems: An industry perspective. arXiv preprint arXiv:2109.06723(2021). Lucas Bernardi Sakshi Batra and Cintia Alicia Bruscantini. 2021. Simulations in Recommender Systems: An industry perspective. arXiv preprint arXiv:2109.06723(2021).

5. Fairness in Recommendation Ranking through Pairwise Comparisons

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3