К содержимому
learnspaceYOUR NEXT CHAPTER
ПРОСТРАНСТВО ОБУЧЕНИЯ
ГлавнаяКаталог курсовМоё обучениеCoursera

Знания без границ

Учитесь у лучших университетов и компаний мира.

Открыть Coursera
Интеграция
Пространство университета
Моё пространствоСтраница курса
↵
ЯЛичный кабинетСтудент
© 2026 LearnSpaceКаждый день — возможность узнать больше.Помощь
Mastering Classic Reinforcement Learning Algorithms · LearnSpace
Назад в каталог
courseraПрограммирование

Mastering Classic Reinforcement Learning Algorithms

Курс от University of Colorado Boulder
Средний≈ 14.5 чАнглийский
О курсеНавыкиПрограммаПреподаватели

О курсе

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

Навыки, которые вы освоите

Reinforcement LearningMarkov ModelModel OptimizationStatistical Machine LearningSampling (Statistics)Probability DistributionApplied MathematicsMachine LearningStatistical MethodsOperations ResearchDecision IntelligenceAlgorithmsProbabilityArtificial Intelligence and Machine Learning (AI/ML)Machine Learning AlgorithmsMachine Learning MethodsTheoretical Computer Science

Программа курса

5 модулей · 101 учебных материалов

01Deterministic Decision Processes25 материалов

Welcome to the Course!

Course IntroductionВидео

Getting Started

Earn Academic Credit for your Work!ЧтениеCourse SupportЧтениеAssessment ExpectationsЧтение

Sequential Decision-Making and Modeling

Учитесь у экспертов

Ashutosh Trivedi

Преподаватель курса

Mastering Classic Reinforcement Learning Algorithms
В каталоге вашей программы

Инвестируйте в себя

Новые знания — в удобное для вас время.

Начать на Coursera

Обучение откроется на Coursera
в новой вкладке

Обучение на Coursera

≈ 14.5 ч

5 модулей

Язык: Английский

Часть программы вашего университета
Decision-Making over Time Видео
Sequential Decision-Making as OptimizationЧтение
States, Actions, Transitions, and Rewards Видео
States, Actions, Transitions, and RewardsЧтение

Deterministic Decision Processes

From Unfolded Decisions to State-Based Models ВидеоFormal Definition of a Deterministic Decision Process ВидеоDeterministic Decision ProcessesЧтение

Reward Streams, Policies, and Values

Discounting Infinite Reward Streams ВидеоDiscounting Infinite Reward StreamsЧтениеRuns, Histories, Policies, and ValuesВидеоPolicies, Runs, and ValuesЧтение

Bellman Equations and Dynamic Programming

Discounted Optimality EquationsВидеоChecking Values and Extracting PoliciesВидеоWhy Bellman Equations Characterize Optimal BehaviorВидеоBellman Equations and Dynamic ProgrammingЧтениеWhy Bellman Equations Characterize Optimal BehaviorЧтение

Fixed Points and Value Iteration

Existence, Uniqueness, and Value IterationВидеоExistence, Uniqueness, and Value IterationЧтение

Module Assignment

Module SummaryЧтениеAI Policy QuizЗаданиеDeterministic Decision ProcessesЗадание
02Markov Chains and Markov Decision Processes18 материалов

From Deterministic to Stochastic Transitions

Module IntroductionВидеоFrom Deterministic to Stochastic TransitionsВидеоFrom Deterministic to Stochastic TransitionsЧтение

Markov Chains

Markov ChainsВидеоMarkov ChainsЧтениеExpected Discounted Reward in Markov ChainsЧтение

Markov Decision Processes

Markov Decision ProcessesВидеоMarkov Decision ProcesssesЧтение

Policies and Values

Policies and ValuesВидеоChecking Values and Extracting PoliciesВидеоPolicies, Value Functions, and Expected Return Чтение

Bellman Optimality Equations

Bellman Optimality EquationsВидеоWhy Bellman Optimality Equations Are CorrectВидеоBellman Equations for MDPsЧтениеBellman Operators and Correctness for MDPsЧтениеComparing DDPs, Markov Chains, and MDPsЧтение

Module Assignment

Module SummaryЧтениеMarkov Chains and Markov Decision ProcessesЗадание
03Dynamic Programming in MDPs18 материалов

Policy Evaluation

Module IntroductionВидеоPlanning SetupВидеоPlanning with a Known Model ЧтениеPolicy EvaluationВидеоPolicy EvaluationЧтение

Policy Improvement

From Values to Better Policies ВидеоPolicy ImprovementЧтение

The Bellman Optimality Operator

The Bellman Optimality Operator ВидеоThe Bellman Optimality Operator Чтение

Value Iteration

Value Iteration as Fixed-Point ComputationВидеоValue IterationЧтение

Policy Iteration

Alternating Evaluation and ImprovementВидеоPolicy IterationЧтение

Linear Programming for MDPs

The Linear Programming View of Optimality ВидеоLinear Programming for Discounted MDPsЧтение

Module Assignment

Module SummaryВидеоModule SummaryЧтениеDynamic Programming in MDPsЗадание
04Learning from Sampled Experience 22 материалов

From Planning to Reinforcement Learning

Module IntroductionВидеоFrom Planning to Reinforcement LearningВидеоFrom Planning to LearningЧтениеFrom Planning to Reinforcement LearningЧтение

Rewards, Uncertainty, and Exploration

Rewards, Uncertainty, and ExplorationВидеоRewards, Uncertainty, and BehaviorЧтение

The Agent–Environment Interface

The Agent–Environment InterfaceВидеоThe Agent–Environment Interaction LoopЧтение

One-Armed Bandits

One-Armed BanditsВидеоOne-Armed BanditsЧтение

Multi-Armed Bandits

Multi-Armed BanditsВидеоMulti-Armed BanditsЧтение

Monte-Carlo Policy Evaluation

Monte Carlo Policy EvaluationВидеоMonte Carlo EstimationЧтениеReturns as Random VariablesЧтениеMonte Carlo Policy EvaluationЧтение

Monte-Carlo Control

Monte Carlo ControlВидеоMonte Carlo ControlЧтениеMonte Carlo Methods versus Dynamic ProgrammingЧтение

Module Assignment

Module SummaryВидеоModule SummaryЧтениеLearning from Sampled Experience Задание
05Control, Exploration, and Tabular RL Algorithms18 материалов

Why Temporal-Difference Learning?

Learning before the Episode EndsВидеоWhy Temporal-Difference Learning?Чтение

TD(0) Policy Evaluation

One-Step Bootstrapped PredictionВидеоTD(0) Policy EvaluationЧтение

SARSA

On-Policy Temporal-Difference Control ВидеоOn-Policy TD ControlЧтение

Q-Learning

Off-Policy Temporal-Difference ControlВидеоQ-Learning: Off-Policy TD ControlЧтение

On-Policy versus Off-Policy Learning

What Policy Is Being Learned? ВидеоOn-Policy and Off-Policy LearningЧтение

Expected SARSA and Maximization Bias

Smoother Targets and OverestimationВидеоExpected SARSA and Maximization BiasЧтение

Double Q-Learning

Reducing Maximization BiasВидеоDouble Q-LearningЧтение

n-Step TD and Course Synthesis

Between Monte Carlo and One-Step TDВидеоn-Step TDЧтениеWhy Move Beyond Tabular Methods?Чтение

Module Assignment

Control, Exploration, and Tabular RL AlgorithmsЗадание