Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions and Approximations
share
We consider the stochastic combinatorial semi-bandit problem with adversarial corruptions. We provide a simple combinatorial algorithm that can achieve a regret of Õ(C+d^2K/Δ_min) where C is the total amount of corruptions, d is the maximal number of arms one can play in each round, K is the number of arms. If one selects only one arm in each round, we achieves a regret of Õ(C+∑_Δ_i>0(1/Δ_i)). Our algorithm is combinatorial and improves on the previous combinatorial algorithm by [Gupta et al., COLT2019] (their bound is Õ(KC+∑_Δ_i>0(1/Δ_i))), and almost matches the best known bounds obtained by [Zimmert et al., ICML2019] and [Zimmert and Seldin, AISTATS2019] (up to logarithmic factor). Note that the algorithms in [Zimmert et al., ICML2019] and [Zimmert and Seldin, AISTATS2019] require one to solve complex convex programs while our algorithm is combinatorial, very easy to implement, requires weaker assumptions and has very low oracle complexity and running time. We also study the setting where we only get access to an approximation oracle for the stochastic combinatorial semi-bandit problem. Our algorithm achieves an (approximation) regret bound of Õ(d√(KT)). Our algorithm is very simple, only worse than the best known regret bound by √(d), and has much lower oracle complexity than previous work.
READ FULL TEXT