# Reinforcement Learning: An Introduction

# # Reinforcement Learning: An Introduction

Metadata

CiteKey:: suttonReinforcementLearningIntroduction2018Type:: bookAuthor::Richard S. Sutton,Andrew G. BartoPublisher:: MIT PressYear:: 2018ISBN:: 978-0-262-03924-6Tags:: #Source/ZoteroFormat:: PDF

Abstract

The significantly expanded and updated new edition of a widely used text on reinforcement learning, one of the most active research areas in artificial intelligence.Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives while interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the field’s key ideas and algorithms. This second edition has been significantly expanded and updated, presenting new topics and updating coverage of other topics.Like the first edition, this second edition focuses on core online learning algorithms, with the more mathematical material set off in shaded boxes. Part I covers as much of reinforcement learning as possible without going beyond the tabular case for which exact solutions can be found. Many algorithms presented in this part are new to the second edition, including UCB, Expected Sarsa, and Double Learning. Part II extends these ideas to function approximation, with new sections on such topics as artificial neural networks and the Fourier basis, and offers expanded treatment of off-policy learning and policy-gradient methods. Part III has new chapters on reinforcement learning’s relationships to psychology and neuroscience, as well as an updated case-studies chapter including AlphaGo and AlphaGo Zero, Atari game playing, and IBM Watson’s wagering strategy. The final chapter discusses the future societal impacts of reinforcement learning.

Files and Links

Uri:: http://zotero.org/users/5055703/items/DGWPM4VVFile:: Google Books Link; sutton_barto_2018_reinforcement_learning.pdfLocal Library:: Zotero

Tags and Collections

Keywords:: Intelligence (AI) & Semantics, RL, 📙, 📥

Table of Content

- Introduction

- Reinforcement Learning
- Examples
- Elements of Reinforcement Learning
- Limitations and Scope
- An Extended Example: Tic-Tac-Toe
- Summary
- Early History of Reinforcement Learning
- Multi-armed Bandits

- A k-armed Bandit Problem
- Action-value Methods
- The 10-armed Testbed
- Incremental Implementation
- Tracking a Nonstationary Problem
- Optimistic Initial Values
- Upper-Confidence-Bound Action Selection
- Gradient Bandit Algorithms
- Associative Search (Contextual Bandits)
- Summary
- Finite Markov Decision Processes

- The Agent–Environment Interface
- Goals and Rewards
- Returns and Episodes
- Unified Notation for Episodic and Continuing Tasks
- Policies and Value Functions
- Optimal Policies and Optimal Value Functions
- Optimality and Approximation
- Summary
- Dynamic Programming

- Policy Evaluation (Prediction)
- Policy Improvement
- Policy Iteration
- Value Iteration
- Asynchronous Dynamic Programming
- Generalized Policy Iteration
- Efficiency of Dynamic Programming
- Summary
- Monte Carlo Methods

- Monte Carlo Prediction
- Monte Carlo Estimation of Action Values
- Monte Carlo Control
- Monte Carlo Control without Exploring Starts
- Off-policy Prediction via Importance Sampling
- Incremental Implementation
- Off-policy Monte Carlo Control
- *Discounting-aware Importance Sampling
- *Per-decision Importance Sampling
- Summary
- Temporal-Difference Learning
- TD Prediction
- Advantages of TD Prediction Methods
- Optimality of TD
- Sarsa: On-policy TD Control
- Q-learning: Off-policy TD Control
- Expected Sarsa
- Maximization Bias and Double Learning
- Games, Afterstates, and Other Special Cases
- Summary
- n-step Bootstrapping

- n-step TD Prediction
- n-step Sarsa
- n-step Off-policy Learning
- *Per-decision Methods with Control Variates
- Off-policy Learning Without Importance Sampling: The n-step Tree Backup Algorithm
- *A Unifying Algorithm: n-step Q
- Summary
- Planning and Learning with Tabular Methods

- Models and Planning
- Dyna: Integrated Planning, Acting, and Learning
- When the Model Is Wrong
- Prioritized Sweeping
- Expected vs Sample Updates
- Trajectory Sampling
- Real-time Dynamic Programming
- Planning at Decision Time
- Heuristic Search
- Rollout Algorithms
- Monte Carlo Tree Search
- Summary of the Chapter
- Summary of Part I: Dimensions
- On-policy Prediction with Approximation

- Value-function Approximation
- The Prediction Objective (VE)
- Stochastic-gradient and Semi-gradient Methods
- Linear Methods
- Feature Construction for Linear Methods

- Polynomials
- Fourier Basis
- Coarse Coding
- Tile Coding
- Radial Basis Functions
- Selecting Step-Size Parameters Manually
- Nonlinear Function Approximation: Artificial Neural Networks
- Least-Squares TD
- Memory-based Function Approximation
- Kernel-based Function Approximation
- Looking Deeper at On-policy Learning: Interest and Emphasis
- Summary

# # Notes

## # By Chapter

- Chapter 5 - Monte Carlo Methods
- Chapter 6 - Temporal-Difference Learning
*Chapter 7 - n-step Bootstrapping*- Chapter 8 - Planning and Learning with Tabular Methods
- Chapter 9 - On-policy Prediction with Approximation