← Search

Jack Mayo

2 accepted papers

2025

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction

NeurIPS 2025poster

We present an efficient algorithm for linear contextual bandits with adversarial losses and stochastic action sets. Our approach reduces this setting to misspecification-robust adversarial linear bandits with fixed action sets. Without knowledge of the context distribution or access to a context sim…

Cited by 0SourceScholar
2023

First- and Second-Order Bounds for Adversarial Linear Contextual Bandits

NeurIPS 2023poster

We consider the adversarial linear contextual bandit setting, which allows for the loss functions associated with each of $K$ arms to change over time without restriction. Assuming the $d$-dimensional contexts are drawn from a fixed known distribution, the worst-case expected regret over the course…

Cited by 10SourcePDFScholar