11 citations · 14 across the 21 of their papers we have counts for
4 papers · 1 filter
A Hierarchical Nearest Neighbour Approach to Contextual Bandits
Stephen Pasteris, Chris Hicks, Vasilios Mavroudis
In this paper we consider the adversarial contextual bandit problem in metric spaces. The paper "Nearest neighbour with bandit feedback" tackled this problem but when there are man…
Sum-max Submodular Bandits
Stephen Pasteris, Alberto Rumi, Fabio Vitale +1
Many online decision-making problems correspond to maximizing a sequence of submodular functions. In this work, we introduce sum-max functions, a subclass of monotone submodular fu…
Nearest Neighbour with Bandit Feedback
Stephen Pasteris, Chris Hicks, Vasilios Mavroudis
In this paper we adapt the nearest neighbour rule to the contextual bandit problem. Our algorithm handles the fully adversarial setting in which no assumptions at all are made abou…
Adversarial Online Collaborative Filtering
Stephen Pasteris, Fabio Vitale, Mark Herbster +2
We investigate the problem of online collaborative filtering under no-repetition constraints, whereby users need to be served content in an online fashion and a given user cannot b…