mlsanityData to 7 Oct 2026

Fast EXP3 Algorithms

arXiv 2512.11201 ↗First posted 12 Dec 2025cs.LG cs.AI cs.DScited by 1

Not on the map. Why?

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 1 of its 8 references that are in the map. First posted on arXiv 12 Dec 2025.

Builds on

1 of 8 references.

References · 1

  1. 2021Rejection sampling from shape-constrained distributions in sublinear timecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

  1. 2026Differential Privacy in the Extensive-Form Bandit Problemcited by 1