Contextual Continuum Bandits: Static Versus Dynamic Regret
<|reference_start|>Contextual Continuum Bandits: Static Versus Dynamic Regret: We study the contextual continuum bandits problem, where the learner sequentially receives a side information vector and has to choose an action in a convex set, minimizing a function associated to the context. The goal is to minimize all the underlying functions for the received contexts, leading to a dynamic (contextual) notion of regret, which is stronger than the standard static regret. Assuming that the objective functions are H\"older with respect to the contexts, we demonstrate that any algorithm achieving a sub-linear static regret can be extended to achieve a sub-linear dynamic regret. We further study the case of strongly convex and smooth functions when the observations are noisy. Inspired by the interior point method and employing self-concordant barriers, we propose an algorithm achieving a sub-linear dynamic regret. Lastly, we present a minimax lower bound, implying two key facts. First, no algorithm can achieve sub-linear dynamic regret over functions that are not continuous with respect to the context. Second, for strongly convex and smooth functions, the algorithm that we propose achieves, up to a logarithmic factor, the minimax optimal rate of dynamic regret as a function of the number of queries.<|reference_end|>
@article{akhavan2024contextual,
    title={Contextual Continuum Bandits: Static Versus Dynamic Regret},
    author={Arya Akhavan, Karim Lounici, Massimiliano Pontil, and Alexandre B.
  Tsybakov},
    journal={arXiv preprint arXiv:2406.05714},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05714},
    primaryClass={stat.ML cs.LG math.ST stat.TH}
}