CS 4789

CS 4789

Course information provided by the Courses of Study 2022-2023.

Reinforcement Learning is one of the most popular paradigms for modelling interactive learning and sequential decision making in dynamical environments. This course introduces the basics of Reinforcement Learning and the Markov Decision Process. The course will cover algorithms for planning and learning in Markov Decision Processes. We will discuss potential applications of Reinforcement Learning and their implications. We will study and implement classic Reinforcement Learning algorithms.

When Offered Spring.

Prerequisites/Corequisites Prerequisite: CS 4780.

Outcomes
  • Identify the differences between Reinforcement Learning and traditional Supervised Learning and grasp the key definitions of Markov Decision Processes.
  • Analyze the performance of the class planning algorithms and learning algorithms for Markov Decision Process.
  • Implement classic algorithms and demonstrate their performance on benchmarks.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Combined with: CS 5789

  • 3 Credits Stdnt Opt

  •  9835 CS 4789   LEC 001

    • MW Olin Hall 255
    • Jan 23 - May 9, 2023
    • Dean, S

  • Instruction Mode: In Person
    Enrollment limited to CS students only. All others should add themselves to the waitlist during add/drop in January.