Anytime#
Read more in the user guide.
Protocol#
Base class for anytime stochastic bandit agents. |
|
Stochastic multi-armed bandit environment. |
|
Interaction loop for the anytime stochastic bandit setting. |
Agents#
Indexed Minimum Empirical Divergence, an asymptotically optimal bandit algorithm. |
|
Baseline that always plays the best arm. |
|
Uniform exploration: pull an arm uniformly at random every round. |
Environments#
Factories building a
StochasticBanditEnv
from a vector of arm means.
Build a Bernoulli bandit from a vector of arm means. |
|
Build a Binomial bandit from a vector of per-trial success probabilities. |
|
Build a Gaussian bandit from vectors of means and variances. |
|
Build a bandit whose arms are Gaussians truncated to |
|
Draw a random Bernoulli instance with a prescribed optimality gap. |
Reward distributions#
The individual arms the factories above are built from.
One bandit arm, adapting a frozen |
|
Bernoulli arm with success probability |
|
Binomial arm: the number of successes in |
|
Gaussian arm of mean |
|
Exponential arm of rate |
|
Gaussian truncated to |
|
Exponential arm clipped at |
Renderers#
Print each bandit round to stdout, one line per pull. |