4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): EE 215 or EE 244 or CS 224 or EE 228 or CS 228 or EE 251B or CS 252B; graduate standing; or consent of instructor. This course introduces key ideas and algorithms of reinforcement learning (RL). Key topics covered include finite Markov Decision Process (MDP), dynamic programming, Monte Carlo methods, temporal-difference learning, policy gradient methods, safety-constrained RL, batch-constrained RL, multi-agent RL, multi-armed bandits, and imitation learning. May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor. Cross-listed with CS 258.
Grade distribution data hasn't been published for this course yet. Check back later as more terms become available.
University of California, Riverside
Reviews, study tips, and grade data for EE 227 at UCR. 4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): EE 215 or EE 244 or CS 224 or EE 228 or…
Related topic in EE
Also in EE
Also in EE
Also in EE
Also in EE
Also in EE
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades