Search Results for author:
Found 2 papers, 0 papers with code
Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
The Indexed Minimum Empirical Divergence (IMED) algorithm is a highly effective approach that offers a stronger theoretical guarantee of the asymptotic optimality compared to the Kullback--Leibler Upper Confidence Bound (KL-UCB) algorithm for the multi-armed bandit problem.
Maillard Sampling: Boltzmann Exploration Done Optimally
This less-known algorithm, which we call Maillard sampling (MS), computes the probability of choosing each arm in a \textit{closed form}, which is not true for Thompson sampling, a widely-adopted bandit algorithm in the industry.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
