1/17

Markov Decision Processes (MDPs) Part 2/2 (CS 188)

Pieter Abbeel UC Berkeley

Professor

1:25:00·2018·undergraduate level

The lecture delves into the Bellman Equations and their role in value iteration convergence, contrasting it with policy evaluation and policy iteration algorithms for solving MDPs.

AI & ML Reinforcement Learning Algorithms & Data Structures Bellman Equations Value Iteration

COMPSCI 188, LEC 001 - Fall 2018

COMPSCI 188, LEC 001 - Pieter Abbeel, Daniel Klein

Copyright @2018 UC Regents; all rights reserved

Previous · Lecture 8

Markov Decision Processes (MDPs) Part 1/2 (CS 188)

Next · Lecture 10

Reinforcement Learning Part 1/2 (CS 188)

Comments

Add a comment...Sign in

Part of course22 lectures

CS 188: Introduction to Artificial Intelligence

Prof. Pieter Abbeel

Uninformed and A* heuristic search, constraint satisfaction, adversarial minimax/expectimax games, Markov decision processes, reinforcement learning, Bayes nets, and particle filtering.

View full syllabus →

Related lectures

Reinforcement Learning Part 1/2 (CS 188)

Pieter Abbeel · UC Berkeley

Next in CS 188 · Lecture 10

Markov Decision Processes (MDPs) Part 1/2 (CS 188)

Pieter Abbeel · UC Berkeley

Shared subfield · Reinforcement Learning & Algorithms & Data Structures

UCL / DeepMind RL Lecture 2: Markov Processes, Reward Processes & Bellman Equations

David Silver · Google DeepMind

Shared subfield · Reinforcement Learning & Bellman Equations

Lecture 6, Part 2 (CS 285)

Sergey Levine · UC Berkeley

Shared subfield · Algorithms & Data Structures & Reinforcement Learning

Lecture 14: Deep Reinforcement Learning (CS231n)

Fei-Fei Li, Justin Johnson & Serena Yeung · Stanford University

Shared subfield · Reinforcement Learning & Algorithms & Data Structures

Lecture 17: Bellman-Ford (6.006)

Srini Devadas · MIT

Shared subfield · Algorithms & Data Structures & Reinforcement Learning