paper-with-me

Papers

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

2022-10-11 · Zhengbang Zhu, Rongjun Qin, JunJie Huang, Xinyi Dai, Yang Yu, Yong Yu, Weinan Zhang

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. 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.

📄 PDF Abstract BibTeX arXiv:2210.05662

Code (0)

등록된 구현이 없습니다.

Tasks

BenchmarkingRecommendation SystemsSequential Recommendation

Similar Papers 제목 키워드 기반

DynaFLIP: Rethinking Robotics Perception via Tri-Modal-Dynamics Guided Representation

2026-05-28 · Jusuk Lee, Seungjae Lee, Jonghun Shin, Hoseong Jung 외 arxiv

Robot manipulation critically depends on perception that preserves the action-relevant aspects of a scene. Yet most robot learning pipelines are built upon visual encoders pre-trained for static recognition or vision-lan…

Robot Manipulation

Rethinking Adversarial Examples for Location Privacy Protection

2022-06-28 · Trung-Nghia Le, Ta Gu, Huy H. Nguyen, Isao Echizen

We have investigated a new application of adversarial examples, namely location privacy protection against landmark recognition systems. We introduce mask-guided multimodal projected gradient descent (MM-PGD), in which a…

Image ManipulationLandmark Recognition

Rethinking Personalized Ranking at Pinterest: An End-to-End Approach

2022-09-18 · Jiajing Xu, Andrew Zhai, Charles Rosenberg

In this work, we present our journey to revolutionize the personalized recommendation engine through end-to-end learning from raw user actions. We encode user's long-term interest in Pinner- Former, a user embedding opti…

CPUGPU

Robust Online Learning with Private Information

2025-05-08 · Kyohei Okumura

This paper investigates the robustness of online learning algorithms when learners possess private information. No-external-regret algorithms, prevalent in machine learning, are vulnerable to strategic manipulation, allo…

Combinatorial Bandits under Strategic Manipulations

2021-02-25 · Jing Dong, Ke Li, Shuai Li, Baoxiang Wang

Strategic behavior against sequential learning methods, such as "click framing" in real recommendation systems, have been widely observed. Motivated by such behavior we study the problem of combinatorial multi-armed band…

Multi-Armed BanditsRecommendation Systems