Reinforcement Learning
24CSE811 · S8 · 4 credits
Official KTU 2024 syllabus subject — study with practice, PYQs and AI tools.
Have an exam tomorrow?
Get a high-yield attack plan focused on maximum marks per minute. Zero fluff, strict PYQ priority, active recall, and trap avoidance.
Strategy: High-yield concepts + PYQs + weak areas
Why:Foundation module
Why:High exam relevance
Why:Core module
Why:Applied concepts
Why:Standard exam coverage
Module 01Introductionexpand
Probability concepts review - Axioms of probability, concepts of random variables, probability mass function, probability density function, cumulative density functions, Expectation. Concepts of joint and multiple random variables, joint, conditional and marginal distributions. Correlation and independence.
Module 02Markov Decision Processexpand
Introduction to Reinforcement Learning(RL) terminology - Examples of RL, Elements of RL, Limitations and Scope of RL. Finite Markov Decision Processes - The Agent–Environment Interface, Goals and Rewards, Returns and Episodes, Policies and Value Functions, Optimal Policies and Optimal Value Functions.
Module 03Prediction And Controlexpand
Dynamic Programming - Policy Evaluation (Prediction), Policy Improvement, Policy Iteration, Value Iteration. Monte Carlo (MC) for model free prediction and control - 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.
Module 04Temporal-Difference (TD) Methods For Model Free Predictionexpand
And Control TD Methods - TD Prediction, Advantages of TD Prediction Methods, Optimality of TD(0), Sarsa: On-policy TD Control, Q-learning: Off-policy TD Control, Expected Sarsa. n-step Bootstrapping- n-step TD Prediction, n-step Sarsa, step Off-policy Learning, Off-policy Learning Without Importance Sampling: The n-step Tree Backup Algorithm.
Module 05Function Approximation Methodexpand
On-policy Prediction with Approximation - Value-function Approximation, The Prediction Objective, Stochastic-gradient Methods, Linear Methods. Eligibility Traces - The λ-return, TD(λ), n-step Truncated λ-return Methods, Sarsa(λ). Policy Gradient Methods - Policy Approximation and its Advantages, The Policy Gradient Theorem, REINFORCE: Monte Carlo Policy Gradient, REINFORCE with Baseline, Actor– Critic Methods.
Exam-focused notes are optional context — Continue Learning above works even without them.
Notes for this subject aren't written yet
Continue Learning above adapts to this subject anyway — it teaches from your active syllabus.