Epsilon-Greedy algorithm
Epsilon-Greedy algorithm
returns the arm that should be pulled. can provide an epsilon value: a number indicating the algorithms propensity for exploration. alternatively, provide an annealing function that will be called with the number of pulls; allowing the algorithm to dampen its exploration over time. 0 < epsilon < 1.
returns the arm that should be pulled. can provide an epsilon value: a number indicating the algorithms propensity for exploration. alternatively, provide an annealing function that will be called with the number of pulls; allowing the algorithm to dampen its exploration over time. 0 < epsilon < 1.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close