Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Reinforcement learning studies how agents learn to make better decisions through interaction with an environment. Agents act, observe consequences, receive feedback, and adapt future behavior. This specialization develops reinforcement learning as a framework for sequential decision-making under uncertainty, progressing from classical foundations to scalable deep learning methods and reward design.
The first course, Classical Reinforcement Learning, introduces finite-state decision problems, Markov chains, Markov decision processes, discounted rewards, Bellman equations, planning with known models, and learning from sampled experience. Learners study value iteration, policy iteration, Monte Carlo methods, temporal-difference learning, SARSA, and Q-learning.
The second course, Deep Reinforcement Learning, shows how reinforcement learning scales beyond tabular settings using neural-network-based function approximation. Learners study Deep Q-Networks, replay buffers, target networks, policy-gradient methods, actor–critic algorithms, and modern methods such as PPO, DDPG, and SAC, with attention to stability, diagnosis, evaluation, and reproducibility.
The third course, Reward Programming, addresses how to design, infer, monitor, and revise objectives so agents learn intended behavior. Learners study temporal logic, automata, reward machines, reward shaping, inverse reinforcement learning, preference feedback, safety, shielding, auditing, and stress testing.
Syllabus
- Course 1: Mastering Classic Reinforcement Learning Algorithms
- Course 2: Deep Reinforcement Learning: From Theory to Practice
- Course 3: Reward Programming: Optimizing RL Efficiency and Safety
Courses
-
How can reinforcement learning scale beyond small tabular problems to high-dimensional environments such as games, robotics, and autonomous decision-making? This course introduces deep reinforcement learning, where reinforcement-learning algorithms are combined with neural-network-based function approximation. Learners begin by studying why tabular methods break down in large or continuous state spaces and how value functions, action-value functions, and policies can be represented by parameterized models. The course then develops value-based deep reinforcement learning methods, including fitted value iteration, Deep Q-Networks, replay buffers, target networks, Double DQN, dueling networks, and prioritized experience replay. Learners also study direct policy optimization through policy-gradient methods such as REINFORCE, as well as actor–critic methods that combine policy optimization with value estimation. The course introduces selected modern deep RL algorithms, such as PPO, DDPG, and SAC, with emphasis on implementation, stability, diagnosis, and empirical evaluation. By the end of the course, learners will be able to implement deep reinforcement-learning agents, diagnose common sources of instability, evaluate learned behavior using suitable experimental protocols, and report results in a reproducible way. This course can be taken for academic credit as part of CU Boulder’s Masters of Science in Computer Science (MS-CS) and Master of Science in Artificial Intelligence (MS-AI) degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more: MS in Artificial Intelligence: https://www.coursera.org/degrees/ms-artificial-intelligence-boulder MS in Computer Science: https://coursera.org/degrees/ms-computer-science-boulder
-
How can an agent learn to make good decisions through repeated interaction with an uncertain environment? This course introduces the mathematical and algorithmic foundations of classical reinforcement learning, with an emphasis on finite Markov decision processes and tabular methods. The course begins with the simplest settings in which the central ideas are clearest: deterministic decision processes, discounted rewards, and Bellman optimality equations. It then introduces stochasticity through Markov chains and Markov decision processes, where learners study policies, value functions, expected discounted reward, and dynamic programming. With this foundation in place, the course turns to planning methods for known models, including value iteration, policy iteration, and linear programming formulations. The second half of the course studies reinforcement learning when the model is unknown and the agent must learn from sampled experience. Topics include multi-armed bandits, exploration and exploitation, Monte Carlo methods, temporal-difference learning, SARSA, Q-learning, and convergence principles. The course ends with a final assessment in which learners solve the same finite MDP from both model-based planning and model-free learning perspectives. By the end of the course, learners will be able to formulate finite decision-making problems as Markov decision processes, solve them using classical planning algorithms, and implement tabular reinforcement-learning algorithms from sampled data. This course provides the foundation for later study of deep reinforcement learning, reward programming, and trustworthy AI systems. This course can be taken for academic credit as part of CU Boulder’s Masters of Science in Computer Science (MS-CS) and Master of Science in Artificial Intelligence (MS-AI) degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more: MS in Artificial Intelligence: https://www.coursera.org/degrees/ms-artificial-intelligence-boulder MS in Computer Science: https://coursera.org/degrees/ms-computer-science-boulder
-
How do we design rewards that guide reinforcement-learning agents toward the behavior we actually intend? This course examines reward design as a programming and specification problem in reinforcement learning. Classical reinforcement learning usually assumes that the objective is given as a scalar reward function. In practice, however, many real tasks involve goals, constraints, temporal order, safety requirements, recurrence, partial observability, hierarchy, other agents, and long-run behavioral expectations that are difficult to express through one-step rewards alone. Poorly designed rewards can lead to reward hacking, specification gaming, and policies that optimize the written objective while missing the designer’s intent. The course introduces reward programming as a structured approach to specifying, shaping, inferring, monitoring, and auditing what an agent should learn. Learners study temporal logic, automata, product MDPs, and reward machines as tools for representing objectives that depend on history, progress, safety, and long-run behavior. They also study reward shaping, inverse reinforcement learning, preference-based feedback, and automata-learning approaches for inferring or improving reward mechanisms. The course then examines richer modeling abstractions for reward programming, including partially observable Markov decision processes, memory and beliefs, hierarchical and recursive tasks, multi- agent settings, and continuous-time systems. The final module studies safety, shielding, constrained RL, auditing, stress testing, and a reward-engineering workflow for connecting designer intent to specifications, reward mechanisms, learning, safety layers, and revision. By the end of the course, learners will be able to design and infer structured reward mechanisms, evaluate whether they align with intended behavior, and reason about their implications for safety, transparency, and reliability. This course can be taken for academic credit as part of CU Boulder’s Masters of Science in Computer Science (MS-CS) and Master of Science in Artificial Intelligence (MS-AI) degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more: MS in Artificial Intelligence: https://www.coursera.org/degrees/ms-artificial-intelligence-boulder MS in Computer Science: https://coursera.org/degrees/ms-computer-science-boulder
Taught by
Ashutosh Trivedi