Overview

Contextual bandits study how to choose an action using information about the current situation when feedback reveals the reward only for the action taken. Common approaches include linear and generalized linear models with UCB or Thompson sampling, alongside kernel, neural, and policy-based methods for richer reward patterns. Offline learning and evaluation, nonstationary or corrupted feedback, and constraints such as budgets, privacy, and safety extend these methods to settings including recommendation, pricing, and LLM routing. A central challenge is balancing exploration with reliable decisions when models are misspecified, feedback is sparse or delayed, and computational or operational costs matter.

Latest papers

CardsList

152 papers20 papers in the last four weeks, up 150% on the four weeks before. 0.1% of all new papers.

  1. Eluder-Dimension-Free Regret for Stage-Wise Constrained Contextual Bandits via Offline Regression

    May 11, 2025Haichen Hu, David Simchi-Levi, Navid AzizanContextual BanditsUCB Algorithms