Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback

NeurIPSSpotlight2025

Authors
Orin Levy, Liad Erez, Alon Cohen, Yishay Mansour
Venue
NeurIPS 2025
Track
Spotlight

TL;DR

We present regret minimization algorithms for the contextual multi-armed bandit (CMAB) problem over $K$ actions in the presence of delayed feedback, a scenario where loss observations arrive with dela…

Opening excerpt from the authors’ abstract. source

Read the paper

Topics

adversarial bandit regret

Related NeurIPS papers

← All NeurIPS 2025 Spotlight papers · Browse the whole archive