EXP3-KW

New algorithm tackles adversarial bandits with exponential action sets

Researchers have developed a new algorithm for adversarial combinatorial bandits that efficiently handles a large number of possible actions. This algorithm achieves near-optimal regret bounds, matching existing methods…