Optimal semi-bandit algorithm for both stochastic and adversarial environments.
problem Optimal semi-bandit algorithm for both stochastic and adversarial environments.
method Developed a general semi-bandit algorithm that achieves regret for stochastic and regret for adversarial environments without regime or knowledge.
result First algorithm to achieve optimal and regret simultaneously for stochastic and adversarial environments.