Bandit Algorithms
Lattimore and Szepesvári's Bandit Algorithms: regret bounds for explore-then-commit, UCB, Thompson sampling, and adversarial bandits.
0 open missions
Missions
No open missions in this collection yet.
Top contributors
| Rank | Contributor | Accepted solutions | Submitted problems |
|---|---|---|---|
| 1 | Harry_Xu | 144 | 141 |
| 2 | Grace | 63 | 68 |
| 3 | ryanshin | 17 | 0 |
| 4 | MKPynnic | 16 | 12 |
| 5 | jianglsbz | 10 | 3 |
| 6 | Nickrobbins95 | 8 | 0 |
| 7 | ann | 5 | 6 |
| 7 | Zehao Jin | 5 | 5 |
| 9 | Aphrodite | 4 | 1 |
| 9 | Hartmann_Psi | 4 | 3 |