Abstract In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either suboptimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., klUCB). We propose a boosting approach to Upper Confidence Bound based algorithms for stochastic bandits, that we call UCBoost. Specifically, we propose two types of UCBoost algorithms. We show that UCBoost(D) enjoys O(1) complexity for each arm per round as well as regret guarantee that is 1/e-close to that of the kl-UCB algorithm. We propose an approximation-based UCBoost algorithm, UCBoost(), that enjoys a regret guarantee -close to that of kl-UCB as well as O(log(1/)) complexity for each arm per round. Hence, our algorithms provide practitioners a practical way to trade optimality with computational complexity. Finally, we present numerical results which show that UCBoost() can achieve the same regret performance as the standard kl-UCB while incurring only 1% of the computational cost of kl-UCB.