conftrace_

implicit exploration

4 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (4) multi-armed bandit (4) regret minimization (2) bandit problem (1) delayed feedback (1) high probability bound (1) high probability guarantee (1) nonstochastic bandit (1) side observation (1) high probability regret (1)

Papers

Mixture-Greedy for Online Generative Model Selection: Is UCB Necessary in Diversity-Aware Multi-Armed Bandits? UAI 2026 A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays NeurIPS 2024 Explore no more: Improved high-probability regret bounds for non-stochastic bandits NeurIPS 2015 Efficient learning by implicit exploration in bandit problems with side observations NeurIPS 2014