Paper bounds bandit regret when delayed rewards omit the round
Balanced Historical Optimism controls delay cost without optimal-arm reports; minimax regret is linear at c=1.
2 stories, newest first · one card per story
Balanced Historical Optimism controls delay cost without optimal-arm reports; minimax regret is linear at c=1.
A new expected sample-complexity measure for stochastic bandits separates known and unknown suboptimality and rules out deterministic algorithms.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views