EC371N Deep Reinforcement Learning

Course Name: 

EC371N Deep Reinforcement Learning

Programme: 

B.Tech (ECE)

Category: 

Programme Specific Electives (PSE)

Credits (L-T-P): 

(3-0-0) 3

Content: 

Introduction: Course logistics and overview. Origin and history of Reinforcement Learning research. Its connections with other related fields and with different branches of machine learning. Markov Decision Process: Introduction to RL terminology, Markov property, Markov chains, Markov reward process (MRP). Introduction to and proof of Bellman equations for MRPs along with proof of existence of solution to Bellman equations in MRP. Introduction to Markov decision process (MDP), state and action value functions, Bellman expectation equations, optimality of value functions and policies, Bellman optimality equations. Prediction and Control by Dynamic Programming: Overview of dynamic programming for MDP, definition and formulation of planning in MDPs, principle of optimality, iterative policy evaluation, policy iteration, value iteration, Banach fixed point theorem, proof of contraction mapping property of Bellman expectation and optimality operators, proof of convergence of policy evaluation and value iteration algorithms, DP extensions. Monte Carlo Methods for Model Free Prediction and Control: Overview of Monte Carlo methods for model free RL, First visit and every visit Monte Carlo, Monte Carlo control, On policy and off policy learning, Importance sampling. Temporal difference (TD Methods: Incremental Monte Carlo Methods for Model Free Prediction, Overview TD(0), TD(1) and TD(λ), k-step estimators, unified view of DP, MC and TD evaluation methods, TD Control methods - SARSA, Q-Learning and their variants. Function Approximation Methods: Getting started with the function approximation methods, Revisiting risk minimization, gradient descent from Machine Learning, Gradient MC and Semi-gradient TD(0) algorithms, Eligibility trace for function approximation, After states, Control with function approximation, Least squares, Experience replay in deep Q-Networks. Policy Gradients: Getting started with policy gradient methods, Log-derivative trick, Naive REINFORCE algorithm, bias and variance in Reinforcement Learning, Reducing variance in policy gradient estimates, baselines, advantage function, actor-critic methods.

References: 

Richard S. Sutton and Andrew G. Barto, "Reinforcement learning: An introduction", Second Edition, MIT Press, 2019.
Wiering, Marco, and Martijn Van Otterlo. "Reinforcement learning." Adaptation, learning, and optimization 12 (2012).
Li, Yuxi. "Deep reinforcement learning." arXiv preprint arXiv:1810.06339 (2018).
Goodfellow, Ian,Yoshua Bengio, and Aaron Courville. "Deep learning." MIT press, 2016
Reinforcement Learningresource: https://web.stanford.edu/class/cs234/modules.html

Department: 

Electronics and Communication Engineering(ECE)
 

Contact us

Prof. Ramesh Kini M.
Professor and Head,
Department of ECE, NITK, Surathkal,
P. O. Srinivasnagar,
Mangalore - 575 025 Karnataka, India.

Connect with us

We're on Social Networks. Follow us & get in touch.