Bernoulli Rank- $1$ Bandits for Click Feedback

19 March 2017

Papers citing "Bernoulli Rank-$1$ Bandits for Click Feedback"

9 / 9 papers shown

Title
Adversarial Online Collaborative Filtering Stephen Pasteris Fabio Vitale Mark Herbster Claudio Gentile Andre' Panisson 24 0 0 11 Feb 2023
Optimal Algorithms for Latent Bandits with Cluster Structure S. Pal A. Suggala Karthikeyan Shanmugam Prateek Jain 37 9 0 17 Jan 2023
Online Low Rank Matrix Completion Prateek Jain S. Pal 42 9 0 08 Sep 2022
Fatigue-aware Bandits for Dependent Click Models Junyu Cao Wei-Ju Sun Zuo-Jun Z. Shen M. Ettl 17 13 0 22 Aug 2020
Exploration by Optimisation in Partial Monitoring Tor Lattimore Csaba Szepesvári 31 38 0 12 Jul 2019
Improved Algorithm on Online Clustering of Bandits Shuai Li Wei Chen Shuai Li K. Leung 16 68 0 25 Feb 2019
Bilinear Bandits with Low-rank Structure Kwang-Sung Jun Rebecca Willett S. Wright Robert D. Nowak 20 60 0 08 Jan 2019
Deep reinforcement learning for search, recommendation, and online advertising: a survey Xiangyu Zhao Long Xia Jiliang Tang Dawei Yin OffRL 30 82 0 18 Dec 2018
Online Learning to Rank in Stochastic Click Models M. Zoghi Tomás Tunys Mohammad Ghavamzadeh B. Kveton Csaba Szepesvári Zheng Wen CML 16 107 0 07 Mar 2017