Search Results for author:
Found 3 papers, 0 papers with code
Bandits with Abstention under Expert Advice
We study the classic problem of prediction with expert advice under bandit feedback.
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
We study best-of-both-worlds algorithms for $K$-armed linear contextual bandits.
Sum-max Submodular Bandits
Many online decision-making problems correspond to maximizing a sequence of submodular functions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
