AI RESEARCH
An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
arXiv CS.LG
•
ArXi:2508.11931v3 Announce Type: replace We present an oracle-efficient, near-optimal algorithm for linear contextual bandits with adversarial losses and stochastic action sets, only requiring a linear optimization oracle for the action sets in each round. Our approach reduces this setting to misspecification-robust adversarial linear bandits with fixed action sets.