Offline Contextual Bandits in the Presence of New Actions
Researchers are exploring advanced techniques for contextual bandit problems, focusing on improving regret bounds and handling dynamic environments. One paper introduces a retry-aware bandit algorithm that aims to optimize for the best outcome among multiple attempts, proving the first sublinear regret bound for this objective. Another study proposes active context selection to enhance simple regret in contextual bandits, showing significant improvements over passive sampling. Additionally, a new method called PONA is presented for offline contextual bandits that can effectively learn and select new actions by leveraging action features, outperforming existing methods that are limited to pre-defined action sets. Finally, a novel approach called RIE-Greedy uses regularization-induced exploration in contextual bandits, demonstrating theoretical equivalence to Thompson Sampling and practical effectiveness. AI
IMPACT These papers introduce novel algorithms and theoretical analyses for contextual bandit problems, potentially improving decision-making in recommendation systems and other applications.