# Fast EXP3 Algorithms

arXiv: https://arxiv.org/abs/2512.11201 · HTML: https://mlsanity.com/paper/2512.11201/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 8 references that are in the map.
- First posted on arXiv 12 Dec 2025.

## Builds on (most cited first, 1 of 1)

- [Rejection sampling from shape-constrained distributions in sublinear time](https://mlsanity.com/paper/2105.14166/) (2021)

## Built on by (most cited first, 1 of 1)

- [Differential Privacy in the Extensive-Form Bandit Problem](https://mlsanity.com/paper/2605.05266/) (2026)

## Abstract (arXiv)

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.