Search Results for author: Jason Rhuggenaath

Found 3 papers, 1 papers with code

Algorithms for slate bandits with non-separable reward functions

no code implementations21 Apr 2020 Jason Rhuggenaath, Alp Akcay, Yingqian Zhang, Uzay Kaymak

In this paper, we study a slate bandit problem where the function that determines the slate-level reward is non-separable: the optimal value of the function cannot be determined by learning the optimal action for each slot.

Cannot find the paper you are looking for? You can Submit a new open access paper.