Winter 2020: Reinforcement Learning
Winter 2020: Reinforcement Learning
Course No:
EECS 598-002
Credit Hours:
3 credits
Instructor:
Lei Ying
Prerequisites:
EECS 502 or equivalent
This course covers fundamental theories and principles of reinforcement learning. Topics to be covered include:
- Dynamic programming and the principle of optimality
- Multi-armed bandit: epsilon-greedy, Upper Confidence Bound (UCB) algorithm, Thompson Sampling
- Markov chains and Markov Decision Process (MDP)
- Value iteration, policy iteration, and LP formulation
- Q-Learning: Model-based and model-free
- Linear function approximation and deep reinforcement learning
- Temporal-difference learning
- SARSA
- Policy gradient algorithm and variance reduction
- The ODE methods and convergence analysis