17 citations · 17 across the 2 of their papers we have counts for
2 papers
cs.LG2021
Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions and Approximations
Haike Xu, Jian Li
We consider the stochastic combinatorial semi-bandit problem with adversarial corruptions. We provide a simple combinatorial algorithm that can achieve a regret of $\tilde{O}\left(…
cs.DS2013★ 17 cited
A Fully Polynomial-Time Approximation Scheme for Approximating a Sum of Random Variables
Jian Li, Tianlin Shi
Given independent random variables and an integer , we study the fundamental problem of computing the probability that the sum is at…