Advanced Bandit Algorithms Research
This cluster of papers focuses on the optimization of multi-armed bandit problems, including topics such as Bayesian optimization, contextual bandits, online learning, convex optimization, Thompson sampling, regret analysis, Gaussian process optimization, hyperparameter optimization, and adversarial multi-armed bandits.
Papers listed on taxonomy pages are the top few works per node from the OpenAlex snapshot. That list is not exhaustive and is not an endorsement. The topic map and the journal registry remain separate: there is still no authoritative topic-to-venue or topic-to-organization edge. Search is a lexical lookup, not a claim that a venue publishes a topic.