reinforcement-learning-an-introduction README

The project's README from github.com/ShangtongZhang/reinforcement-learning-an-introduction. As one markdown file: README.md.

Reinforcement Learning: An Introduction

Build Status

Python replication for Sutton & Barto's book Reinforcement Learning: An Introduction (2nd Edition)

If you have any confusion about the code or want to report a bug, please open an issue instead of emailing me directly, and unfortunately I do not have exercise answers for the book.

Contents

Chapter 1

  1. Tic-Tac-Toe

Chapter 2

  1. Figure 2.1: An exemplary bandit problem from the 10-armed testbed
  2. Figure 2.2: Average performance of epsilon-greedy action-value methods on the 10-armed testbed
  3. Figure 2.3: Optimistic initial action-value estimates
  4. Figure 2.4: Average performance of UCB action selection on the 10-armed testbed
  5. Figure 2.5: Average performance of the gradient bandit algorithm
  6. Figure 2.6: A parameter study of the various bandit algorithms

Chapter 3

  1. Figure 3.2: Grid example with random policy
  2. Figure 3.5: Optimal solutions to the gridworld example

Chapter 4

  1. Figure 4.1: Convergence of iterative policy evaluation on a small gridworld
  2. Figure 4.2: Jack’s car rental problem
  3. Figure 4.3: The solution to the gambler’s problem

Chapter 5

  1. Figure 5.1: Approximate state-value functions for the blackjack policy
  2. Figure 5.2: The optimal policy and state-value function for blackjack found by Monte Carlo ES
  3. Figure 5.3: Weighted importance sampling
  4. Figure 5.4: Ordinary importance sampling with surprisingly unstable estimates

Chapter 6

  1. Example 6.2: Random walk
  2. Figure 6.2: Batch updating
  3. Figure 6.3: Sarsa applied to windy grid world
  4. Figure 6.4: The cliff-walking task
  5. Figure 6.6: Interim and asymptotic performance of TD control methods
  6. Figure 6.7: Comparison of Q-learning and Double Q-learning

Chapter 7

  1. Figure 7.2: Performance of n-step TD methods on 19-state random walk

Chapter 8

  1. Figure 8.2: Average learning curves for Dyna-Q agents varying in their number of planning steps
  2. Figure 8.4: Average performance of Dyna agents on a blocking task
  3. Figure 8.5: Average performance of Dyna agents on a shortcut task
  4. Example 8.4: Prioritized sweeping significantly shortens learning time on the Dyna maze task
  5. Figure 8.7: Comparison of efficiency of expected and sample updates
  6. Figure 8.8: Relative efficiency of different update distributions

Chapter 9

  1. Figure 9.1: Gradient Monte Carlo algorithm on the 1000-state random walk task
  2. Figure 9.2: Semi-gradient n-steps TD algorithm on the 1000-state random walk task
  3. Figure 9.5: Fourier basis vs polynomials on the 1000-state random walk task
  4. Figure 9.8: Example of feature width’s effect on initial generalization and asymptotic accuracy
  5. Figure 9.10: Single tiling and multiple tilings on the 1000-state random walk task

Chapter 10

  1. Figure 10.1: The cost-to-go function for Mountain Car task in one run
  2. Figure 10.2: Learning curves for semi-gradient Sarsa on Mountain Car task
  3. Figure 10.3: One-step vs multi-step performance of semi-gradient Sarsa on the Mountain Car task
  4. Figure 10.4: Effect of the alpha and n on early performance of n-step semi-gradient Sarsa
  5. Figure 10.5: Differential semi-gradient Sarsa on the access-control queuing task

Chapter 11

  1. Figure 11.2: Baird's Counterexample
  2. Figure 11.6: The behavior of the TDC algorithm on Baird’s counterexample
  3. Figure 11.7: The behavior of the ETD algorithm in expectation on Baird’s counterexample

Chapter 12

  1. Figure 12.3: Off-line λ-return algorithm on 19-state random walk
  2. Figure 12.6: TD(λ) algorithm on 19-state random walk
  3. Figure 12.8: True online TD(λ) algorithm on 19-state random walk
  4. Figure 12.10: Sarsa(λ) with replacing traces on Mountain Car
  5. Figure 12.11: Summary comparison of Sarsa(λ) algorithms on Mountain Car

Chapter 13

  1. Example 13.1: Short corridor with switched actions
  2. Figure 13.1: REINFORCE on the short-corridor grid world
  3. Figure 13.2: REINFORCE with baseline on the short-corridor grid-world

Environment

Usage

All files are self-contained

python any_file_you_want.py

Contribution

If you want to contribute some missing examples or fix some bugs, feel free to open an issue or make a pull request.

reinforcement-learning-an-introduction (ShangtongZhang/reinforcement-learning-an-introduction)

Searching Database…

14.8K ·GitHub
Reinforcement-learning-an-introduction
这是什么？这是 Sutton & Barto 教材《Reinforcement Learning: An Introduction》（第 2 版）中所有代码、图表和示例的 Python 重新实现。
这是我可以导入的库，还是一组独立的示例脚本？这是一组独立的 Python 脚本，每个书本章节对应一组，每个脚本复现书中某个特定的图表或示例。
我该怎么运行这些示例？克隆仓库，然后直接用 Python 运行你想看的章节或图表对应的脚本即可。每个文件都是自包含的，无需任何项目配置。
运行这些脚本前，我需要安装什么？Python 3.6，以及 numpy、matplotlib、seaborn 和 tqdm。
这里有书中习题的答案吗？没有。维护者明确表示不提供习题答案，仓库只涵盖章节中展示的图表和示例。
代码是怎么组织的？按书中章节组织（第 1 章至第 13 章），每个编号项对应该章的一个特定图表或示例。例如，第 6 章涵盖有风网格世界上的 Sarsa，以及 Q-learning 与 Double Q-learning 的对比。
涵盖了哪些强化学习算法和主题？多臂老虎机、动态规划、蒙特卡洛方法、时序差分学习（Sarsa、Q-learning、Double Q-learning）、n 步方法、Dyna 规划、函数逼近（瓦片编码、傅里叶基）、资格迹（TD-lambda）以及策略梯度（REINFORCE）。
What are similar projects?grokking_algorithms, spinningup, awesome-computer-vision, DeepLearning, Statistical-Learning-Method_Code, reinforcement-learning, Machine-Learning, transferlearning
Which topics is it in?code, numpy, examples, algorithms, reinforcement-learning, academic-research, book, artificial-intelligence, learning-resources, tutorial, curated-list, resources
Creator
ShangtongZhang
Size
5.9 MB
Stars
14.8K
Updated
CommitApr 16
Age
10y
Commits · 90 Days