KO
|
EN
gitlite — search
Search
#typescript
#ai-agents
#ai
#dsh-plugin
#deepseek-harness
#open-source
#claude-code
#codex
#cli
#developer-tools
#react
#windows
slots
★ 81
Open GitHub ↗
A multi-armed bandit library for Python
Download README (.md)
Explore Similar Repositories
droptools
:
Addon bundle for Dropwizard to support jOOQ for database access
suricatta
:
High level sql toolkit for clojure (backed by jooq library)
rtrlib
:
An open-source C implementation of the RPKI/Router Protocol client
TinyMCE-FontAwesome-Plugin
:
A plugin that lets you insert FontAwesome icons via TinyMCE
newsfeed
:
Demo: implementing a Twitter-like news feed using Apache Samza
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
slots
?
Download (.md)
# slots ## *A multi-armed bandit library for Python* Slots is intended to be a basic, very easy-to-use multi-armed bandit library for Python. [](https://pypi.org/project/slots/) [](https://pypi.org/project/slots/) [](https://pepy.tech/project/slots) [](https://github.com/psf/black) [](http://mypy-lang.org/) ### Author [Roy Keyes](https://roycoding.github.io) -- roy.coding@gmail ### License: MIT See [LICENSE.txt](https://github.com/roycoding/slots/blob/master/LICENSE.txt) ### Introduction slots is a Python library designed to allow the user to explore and use simple multi-armed bandit (MAB) strategies. The basic concept behind the multi-armed bandit problem is that you are faced with *n* choices (e.g. slot machines, medicines, or UI/UX designs), each of which results in a "win" with some unknown probability. Multi-armed bandit strategies are designed to let you quickly determine which choice will yield the highest result over time, while reducing the number of tests (or arm pulls) needed to make this determination. Typically, MAB strategies attempt to strike a balance between "exploration", testing different arms in order to find the best, and "exploitation", using the best known choice. There are many variation of this problem, see [here](https://en.wikipedia.org/wiki/Multi-armed_bandit) for more background. slots provides a hopefully simple API to allow you to explore, test, and use these strategies. Basic usage looks like this: Using slots to determine the best of 3 variations on a live website. ```Python import slots mab = slots.MAB(3, live=True) ``` Make the first choice randomly, record responses, and input reward 2 was chosen. Run online trial (input most recent result) until test criteria is met. ```Python mab.online_trial(bandit=2,payout=1) ``` The response of `mab.online_trial()` is a dict of the form: ```Python {'new_trial': boolean, 'choice': int, 'best': int} ``` Where: - If the criterion is met, `new_trial` = `False`. - `choice` is the current choice of arm to try. - `best` is the current best estimate of the highest payout arm. To test strategies on arms with pre-set probabilities: ```Python # Try 3 bandits with arbitrary win probabilities b = slots.MAB(3, live=False) b.run() ``` To inspect the results and compare the estimated win probabilities versus the true win probabilities: ```Python # Current best guess b.best() > 0 # Estimate of the payout probabilities b.est_probs() > array([ 0.83888149, 0.78534031, 0.32786885]) # Ground truth payout probabilities (if known) b.bandits.probs > [0.8020877268854065, 0.7185844454955193, 0.16348877912363646] ``` By default, slots uses the epsilon greedy strategy. Besides epsilon greedy, the softmax, upper confidence bound (UCB1), and Bayesian bandit strategies are also implemented. #### Regret analysis A common metric used to evaluate the relative success of a MAB strategy is "regret". This reflects that fraction of payouts (wins) that have been lost by using the sequence of pulls versus the currently best known arm. The current regret value can be calculated by calling the `mab.regret()` method. For example, the regret curves for several different MAB strategies can be generated as follows: ```Python import matplotlib.pyplot as plt import slots # Test multiple strategies for the same bandit probabilities probs = [0.4, 0.9, 0.8] strategies = [{'strategy': 'eps_greedy', 'regret': [], 'label': '$\epsilon$-greedy ($\epsilon$=0.1)'}, {'strategy': 'softmax', 'regret': [], 'label': 'Softmax ($T$=0.1)'}, {'strategy': 'ucb', 'regret': [], 'label': 'UCB1'}, {'strategy': 'bayesian', 'regret': [], 'label': 'Bayesian bandit'}, ] for s in strategies: s['mab'] = slots.MAB(probs=probs, live=False) # Run trials and calculate the regret after each trial for t in range(10000): for s in strategies: s['mab']._run(s['strategy']) s['regret'].append(s['mab'].regret()) # Pretty plotting plt.style.use(['seaborn-poster','seaborn-whitegrid']) plt.figure(figsize=(15,4)) for s in strategies: plt.plot(s['regret'], label=s['label']) plt.legend() plt.xlabel('Trials') plt.ylabel('Regret') plt.title('Multi-armed bandit strategy performance (slots)') plt.ylim(0,0.2); ```  ### API documentation For documentation on the slots API, see [slots-docs.md](https://github.com/roycoding/slots/blob/master/docs/slots-docs.md). ### Todo list: - More MAB strategies - Argument to save regret values after each trial in an array. - TESTS! ### Contributing I welcome contributions, though the pace of development is highly variable. Please file issues and submit pull requests as makes sense. The current development environment uses: - pytest >= 5.3 (5.3.2) - black >= 19.1 (19.10b0) - mypy = 0.761 You can pip install these easily by including `dev-requirements.txt`. For mypy config, see `mypy.ini`. For black config, see `pyproject.toml`.
