Library for multi-armed bandit selection strategies, including efficient deterministic implementations of Thompson sampling and epsilon-greedy.
-
Updated
Oct 8, 2024 - Go
Library for multi-armed bandit selection strategies, including efficient deterministic implementations of Thompson sampling and epsilon-greedy.
汤普森采样的通用服务,用于从redis中获得目标物品的alpha,beta值,然后过beta分布随机出一个数值后做排序
A golang library for solving multi armed bandit problem which can optimize your business choice on the fly without A/B testing
Add a description, image, and links to the thompson-sampling topic page so that developers can more easily learn about it.
To associate your repository with the thompson-sampling topic, visit your repo's landing page and select "manage topics."