Created
December 15, 2019 14:48
-
-
Save tuzz/75765f9b8adf109e0f449f50ab6c0721 to your computer and use it in GitHub Desktop.
Playing with 'bandits' from reinforcement learning
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
NUMBER_OF_BANDITS = 4 | |
EPSILON = 0.001 | |
VALUES_AND_OCCURENCES = NUMBER_OF_BANDITS.times.map { [0, 0] } | |
def greedy_action | |
VALUES_AND_OCCURENCES.map.with_index { |(v, o), i| [v, o, i] }.max_by(&:first).last | |
end | |
def random_action | |
NUMBER_OF_BANDITS.times.to_a.sample | |
end | |
def bandit(action, turns) | |
if turns > 50000 | |
Math.sin(action) + rand * 5 | |
else | |
Math.cos(action) + rand * 3 | |
end | |
end | |
total_reward = 0 | |
turns = 0; | |
loop do | |
action = rand < EPSILON ? random_action : greedy_action | |
reward = bandit(action, turns) | |
total_reward += reward | |
turns += 1 | |
prev_value, occurences = VALUES_AND_OCCURENCES[action] | |
occurences += 1 | |
new_value = prev_value + (1.0 / occurences) * (reward - prev_value) | |
VALUES_AND_OCCURENCES[action] = [new_value, occurences] | |
puts total_reward.to_f / turns | |
puts VALUES_AND_OCCURENCES.inspect | |
end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment