Advanced Bandit Algorithms Research
Advanced Bandit Algorithms Research is a research topic within Management Science and Operations Research. Science Explorer counts 8.2k research works in it since 1956. 10.2% of them reached the world's top 10% most cited for their field and year.
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.
- Bandit Optimization
- Bayesian Optimization
- Contextual Bandits
- Online Learning
- Convex Optimization
- Thompson Sampling
- Regret Analysis
- Gaussian Process Optimization
- Hyperparameter Optimization
- Adversarial Multi-Armed Bandits
- Research works
- 8.2k fractional, since 1956
- In the world top 10%
- 829 per year above
- Top-10% rate
- 10.2% share of its works in the world top 10%
- Growth, 2018-21 → 2022-25
- +19% the tick is no change
- Largest producer
China
37% of the 10 largest, 2022-now
Drawing this view