We point out that EXP3 can be implemented in constant time per round, propose more practical algorithms, and analyze the trade-offs between the regret bounds and time complexities of these algorithms.

翻译：我们指出EXP3算法可以在每轮以常数时间实现，提出了更具实用性的算法，并分析了这些算法的遗憾界与时间复杂性之间的权衡关系。