Classical reinforcement learning problem on Go
-
Updated
Aug 8, 2022 - Go
Classical reinforcement learning problem on Go
Library for multi-armed bandit selection strategies, including efficient deterministic implementations of Thompson sampling and epsilon-greedy.
Add a description, image, and links to the multiarmed-bandits topic page so that developers can more easily learn about it.
To associate your repository with the multiarmed-bandits topic, visit your repo's landing page and select "manage topics."