cs.LG, stat.ML

Fast Best-in-Class Regret for Contextual Bandits

arXiv:2510.15483v2 Announce Type: replace-cross
Abstract: We study the problem of stochastic contextual bandits in the agnostic setting, where the goal is to compete with the best policy in a given class without assuming realizability or imposing mode…