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

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

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

Открыть Coursera
Интеграция
Пространство университета
Моё пространствоСтраница курса
↵
ЯЛичный кабинетСтудент
© 2026 LearnSpaceКаждый день — возможность узнать больше.Помощь
Reward Programming: Optimizing RL Efficiency and Safety · LearnSpace
Назад в каталог
courseraПрограммирование

Reward Programming: Optimizing RL Efficiency and Safety

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

О курсе

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

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

Reinforcement LearningAI WorkflowsResponsible AIAgentic systemsModel EvaluationTheoretical Computer ScienceArtificial IntelligenceMarkov ModelContinuous MonitoringFunctional SpecificationComputational LogicApplied Machine LearningMachine LearningModel OptimizationSafety and SecurityVerification And Validation

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

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

01Why Reward Engineering Is Hard18 материалов

Welcome to the Course!

Course IntroductionВидео

Course Policies and Expectations

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

Reward Engineering as Specification Design

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

Ashutosh Trivedi

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

Reward Programming: Optimizing RL Efficiency and Safety
В каталоге вашей программы

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

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

Начать на Coursera

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

Обучение на Coursera

≈ 13.1 ч

5 модулей

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

Часть программы вашего университета
Module IntroductionВидео
Reward Engineering as Specification DesignВидео
Programming by RewardsЧтение

Reward Hacking and Specification Gaming

When High Reward is not the Intended BehaviorВидеоReward Hacking and Specification GamingЧтение

Beyond One-Step Rewards

Temporal Structure in Learning ObjectivesВидеоBeyond One-Step RewardsЧтение

Markovian and Non-Markovian Rewards

When Rewards Need MemoryВидеоMarkovian and Non-Markovian RewardsЧтение

A Formal-Methods Perspective

From Intent to Specifications and MontiorsВидеоFormal-MethodsЧтение

Module Assignment

SummaryЧтениеAI Policy QuizЗаданиеWhy Reward Engineering Is HardЗадание
02Temporal Logic for Reinforcement Learning16 материалов

From Trajectories to Traces

Module 2 IntroductionВидеоLabeling Behavior with Atomic PropositionsВидеоRL Trajectories and Labeled TracesЧтение

Linear Temporal Logic

Writing Temporal SpecificationsВидеоInterpreting Formulas Over TracesВидеоLinear Temporal Logic SemanticsЧтение

Common Specification Patterns

Reachability, Safety, Response, Recurrence, and PersitenceВидеоPolicies and Satisfaction ProbabilityЧтениеCommon Specification PatternsЧтение

Omega-Regular Objectives and Büchi Automata

Long-Run Objectives for Infinite BehaviorВидеоω -Regular ObjectivesЧтениеBüchi Automata as MonitorsЧтение

From Automata to Model-Free RL

Product MDPs, Limit Determinism, and Limit ReachabilityВидеоFrom Automata to Model-Free RLЧтение

Module Assignment

SummaryЧтениеTemporal Logic for Reinforcement LearningЗадание
03Reward Machines as Structured Reward Specifications14 материалов

Why Reward Machines?

Module IntroductionВидеоWhen Rewards Need MemoryВидеоWhy Rewards May Need MemoryЧтение

Reward Machines as Finite-State Reward Programs

States, Transitions, and RewardsВидеоReward MachinesЧтение

Product MDPs with Reward-Machine State

Making Non-Markovian Rewards MarkovianВидеоProduct MDPs with Reward-Machine StateЧтение

Reward Machines for Common Task Patterns

Sequencing, Safety, Response, and RecurrenceВидеоReward Machines for Common Task PatternsЧтение

Using Reward-Machine Structure

Decomposition, Interpretability, and Counterfactual ExperienceВидеоUsing Reward-Machine StructureЧтение

Extensions and Froniters

Extensions and FrontiersЧтение

Module Assignment

SummaryЧтениеReward Machines as Structured Reward SpecificationsЗадание
04Reward Shaping and Learning Rewards15 материалов

Reward Shaping

Module IntroductionВидеоMaking Learning Signals More InformativeВидеоReward ShapingЧтение

Potential-Based Reward Shaping

Densifying Rewards While Preserving OptimalityВидеоPotential-Based ShapingЧтение

Inverse Reinforcement Learning

Inferring Rewards From Expert BehaviorВидеоInverse Reinforcement LearningЧтение

Performance-Based Reinforcement Learning

Learning Objectives From ComparisonsВидеоPreference-Based Reinforcement LearningЧтение

Learning Reward Machines

Inferring Structured Reward LogicВидеоLearning Reward MachinesЧтение

Auditing Learned Rewards

Faithfulness, Robustness, and Specification GamingВидеоAuditing Learned RewardsЧтение

Module Assignment

SummaryЧтениеReward Shaping and Learning RewardsЗадание
05Richer Models for Reward Programming15 материалов

Partial Observability

Module IntroductionВидеоWhen the Agent Does Not See the Full StateВидеоPartial ObservabilityЧтение

Beliefs and Memory

Information States For Reward ProgrammingВидеоHistories, Beliefs, and MemoryЧтение

Hierarchy and Recursion

Reward Structure for Composed TasksВидеоHierarchy and RecursionЧтение

Multi-Agent Reward Programming

Objectives Under Strategic InteractionВидеоMulti-Agent Reward ProgrammingЧтение

Continuous-Time and Dynamical Systems

Reward Programming Beyond Discrete TimeВидеоContinuous-Time and Dynamical SystemsЧтениеChoosing the Right AbstractionЧтение

Module Assignment

Summary and Further ReadingsВидеоSummaryЧтениеPartial ObservabilityЗадание