Home » Course Layouts » Free Course Layout Udemy

This course is an introduction to the theory and application of large-scale dynamic programming.

0

English

English [CC]

FREE

Description

Topics include Markov decision processes, dynamic programming algorithms, simulation-based algorithms, theory and algorithms for value function approximation, and policy search methods. The course examines games and applications in areas such as dynamic resource allocation, finance and queueing networks.

Course content

  • Markov Decision Processes Unlimited
  • Gauss-Seidel Value Iteration Unlimited
  • Asynchronous Policy Iteration Unlimited
  • Blackwell Optimality Unlimited
  • Average-Cost Problems Computational Methods Unlimited
  • Real-Time Value Iteration Unlimited
  • Q-Learning Stochastic Approximations Unlimited
  • Convergence of Q-Learning Unlimited
  • Exploration versus Exploitation: The Complexity of Reinforcement Learning Unlimited
  • Approximation Architectures Unlimited
  • Model Selection and Complexity Unlimited
  • Performance Bounds Unlimited
  • Temporal-Difference Learning with Value Function Approximation Unlimited
  • Temporal-Difference Learning with Value Function Approximation (cont.) Unlimited
  • General Control Problems Unlimited
  • Approximate Linear Programming Unlimited
  • Approximate Linear Programming (cont.) Unlimited
  • Efficient Solutions for Approximate Linear Programming Unlimited
  • Efficient Solutions for Approximate Linear Programming: Factored MDPs Unlimited
  • Policy Search Methods Unlimited
  • Policy Search Methods (cont.) Unlimited

N.A

0 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

Instructor

Massachusetts Institute of Technology
Profile Photo
5 5
1
1916
1520

Explore Free Courses

Access valuable knowledge without any cost.