Skip to content

Latest commit

 

History

History
11 lines (10 loc) · 589 Bytes

README.md

File metadata and controls

11 lines (10 loc) · 589 Bytes

bandits

Solutions to the multi-armed bandits problems described in book Reinforcement Learning: An Introduction by Sutton and Barto.
Includes the following algorithms for learning optimal strategies (see Agents.py)-

  1. epsilon greedy algorithm
  2. softmax algorithm

Results:

![/graphs/nArmedBanditAvgRewardsComparison.png](/graphs/nArmedBanditAvgRewardsComparison.png?raw=true "varying epsilon in epsilon greedy: avg. reward vs iterations") ![/graphs/eGreedyvsSoftmax.png](/graphs/eGreedyvsSoftmax.png?raw=true "Epsilon-Greedy vs Softmax performance")