Introduction to Reinforcement Learning

CT Score

1500

#0 of 0 in ENG EC

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

Students must either take all three of MA225, EK103, and EK 381 (Multi -variable Calculus, Linear Algebra, Probability, or their equivalents) or all three of DS 120, 121, 122 (Foundations of Data Scien - Reinforcement learning is a subfield of artificial intelligence which deals with learning from repeated interactions with an environment. Reinforcement learning is the basis for algorithms for playing strategy games such as Chess, Go, Backgammon, and Starcraft, as well as a number of algorithms throughout robotics, operations research, and other fields of engineering. This course will cover the fundamental algorithms of reinforcement learning, focusing on the core principles underlying these methods. Topics covered will include Dynamic Programming, Markov Decision Processes, Value Iteration, Policy Iteration, Temporal Difference Methods and Monte Carlo, Function Approximation in Reinforcement Learning and Neural Networks→ENG EC 418→unlocks 0 courses

No mapped courses require this one yet. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.