Library for multi-armed bandit selection strategies, including efficient deterministic implementations of Thompson sampling and epsilon-greedy.
-
Updated
Jun 11, 2024 - Go
Library for multi-armed bandit selection strategies, including efficient deterministic implementations of Thompson sampling and epsilon-greedy.
A golang library for solving multi armed bandit problem which can optimize your business choice on the fly without A/B testing
Implementations of solutions to the multi-armed bandit problem
A bandit server that implements the multi-armed bandit for running a single experiment
A simple multi-armed bandit for Go.
Add a description, image, and links to the multi-armed-bandit topic page so that developers can more easily learn about it.
To associate your repository with the multi-armed-bandit topic, visit your repo's landing page and select "manage topics."