Adversarial Attacks on Online Learning to Rank with Stochastic Click Models
We propose the first study of adversarial attacks on online learning to rank. The goal of the adversary is to misguide the online learning to rank algorithm to place the target item on top of the ranking list linear times to time horizon $T$ with a sublinear attack cost. We propose generalized list poisoning attacks that perturb the ranking list presented to the user. This strategy can efficiently attack any no-regret ranker in general stochastic click models. Furthermore, we propose a click poisoning-based strategy named attack-then-quit that can efficiently attack two representative OLTR algorithms for stochastic click models. We theoretically analyze the success and cost upper bound of the two proposed methods. Experimental results based on synthetic and real-world data further validate the effectiveness and cost-efficiency of the proposed attack strategies.
Code (0)
등록된 구현이 없습니다.
Tasks
Learning-To-RankSimilar Papers 제목 키워드 기반
Adversarial Attacks on Online Learning to Rank with Click Feedback
Online learning to rank (OLTR) is a sequential decision-making problem where a learning agent selects an ordered list of items and receives feedback through user clicks. Although potential attacks against OLTR algorithms…
Decision MakingLearning-To-RankSequential Decision MakingOnline Learning to Rank in Stochastic Click Models
Online learning to rank is a core problem in information retrieval and machine learning. Many provably efficient algorithms have been recently proposed for this problem in specific click models. The click model is a mode…
Information RetrievalLearning-To-RankRetrievalSimultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model
Online learning to rank (OLTR) interactively learns to choose lists of items from a large collection based on certain click models that describe users' click behaviors. Most recent works for this problem focus on the sto…
Learning-To-RankPositionTopRank: A practical algorithm for online stochastic ranking
Online learning to rank is a sequential decision-making problem where in each round the learning agent chooses a list of items and receives feedback in the form of clicks from the user. Many sample-efficient algorithms h…
Decision MakingLearning-To-RankPositionSequential Decision MakingCascading Bandits Robust to Adversarial Corruptions
Online learning to rank sequentially recommends a small list of items to users from a large candidate set and receives the users' click feedback. In many real-world scenarios, users browse the recommended list in order a…
Learning-To-Rank