3.7. SequentialLearning.Algorithms.RoundRobin
Round-Robin algorithm
That algorithm chooses each of finitely many actions in a round-robin fashion.
That is, if there are K actions numbered from 0 to K - 1, then at time n it chooses
he action n % K.
Main definitions
-
roundRobinAlgorithm: the Round-Robin algorithm.
Module LeanMachineLearning.SequentialLearning.Algorithms.RoundRobin contains 12 exposed declarations.
-
sum_mod_range -
sum_mod_range_mul -
Learning.RoundRobin.nextAction -
Learning.roundRobinAlgorithm -
Learning.RoundRobin.action_zero -
Learning.RoundRobin.action_ae_eq_roundRobinNextAction -
Learning.RoundRobin.action_ae_eq -
Learning.RoundRobin.pullCount_mul -
Learning.RoundRobin.pullCount_eq_one -
Learning.RoundRobin.time_gt_of_pullCount_gt_one -
Learning.RoundRobin.pullCount_pos_of_time_ge -
Learning.RoundRobin.pullCount_pos_of_pullCount_gt_one