mlsanityData to 14 Oct 2026

Adversarial Recommendation: Attack of the Learned Fake Users

arXiv 1809.08336 ↗First posted 21 Sep 2018cs.IR cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Can machine learning models for recommendation be easily fooled? While the question has been answered for hand-engineered fake user profiles, it has not been explored for machine learned adversarial attacks. This paper attempts to close this gap. We propose a framework for generating fake user profiles which, when incorporated in the training of a recommendation system, can achieve an adversarial intent, while remaining indistinguishable from real user profiles. We formulate this procedure as a repeated general-sum game between two players: an oblivious recommendation system R and an adversarial fake user generator A with two goals: (G1) the rating distribution of the fake users needs to be close to the real users, and (G2) some objective fA encoding the attack intent, such as targeting the top-K recommendation quality of R for a subset of users, needs to be optimized. We propose a learning framework to achieve both goals, and offer extensive experiments considering multiple types of attacks highlighting the vulnerability of recommendation systems.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Sep 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 2; 2023: 0; 2024: 0; 2025: 1.

5 papers.