Fast EXP3 Algorithms
About
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.
Ryoma Sato, Shinji Ito• 2025
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Regret Minimization | Multi-armed Bandit anytime setting | Regret Coefficient2 | 5 |
Showing 1 of 1 rows