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 builds & hosts documentation for Clojure/Script libraries
Ctrl+k | Jump to recent docs |
← | Move to previous article |
→ | Move to next article |
Ctrl+/ | Jump to the search field |