3 papers
cs.LG2025
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously
Stephen Pasteris, Chris Hicks, Vasilios Mavroudis +1
We consider the classic problem of online convex optimisation. Whereas the notion of static regret is relevant for stationary problems, the notion of switching regret is more appro…
cs.LG2024
Bandits with Abstention under Expert Advice
Stephen Pasteris, Alberto Rumi, Maximilian Thiessen +4
We study the classic problem of prediction with expert advice under bandit feedback. Our model assumes that one action, corresponding to the learner's abstention from play, has no…
cs.LG2024
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…