most citedAdversarial Attacks on Online Learning to Rank with Stochastic Click Models

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.LGShow all

2 papers · 1 filter

cs.LG2023

Pure Exploration in Asynchronous Federated Bandits

Zichen Wang, Chuanhao Li, Chenyu Song +3

We study the federated pure exploration problem of multi-armed bandits and linear bandits, where agents cooperatively identify the best arm via communicating with the central s…

cs.LG2023★ 1 cited

Adversarial Attacks on Online Learning to Rank with Stochastic Click Models

Zichen Wang, Rishab Balasubramanian, Hui Yuan +3

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 ite…