Skip to content
All tags

#cs285

6 posts

Exploration, RL Theory, Multitask Learning, and Open Problems | Berkeley CS285 Lectures 19–25

The final seven lectures move from exploration and theoretical limits through two review lectures to advanced exploration, multitask RL, and unresolved research problems.

The CPU, GPU, and H100 Boundary | Berkeley CS285 Topic Guide

Five assignments move from CPU-friendly imitation learning to H100-based LLM RL and six-hour offline-RL runs; self-learners should use three compute tiers instead of copying the entire enrolled workflow.

Imitation Learning, Distribution Shift, and RL Basics | Berkeley CS285 Lectures 1–4

The first four lectures move from behavioral cloning to MDPs; HW1 turns distribution shift into an observable failure through MSE policies, DAgger, and flow matching.

From Variational Inference and LLM RL to Offline RL | Berkeley CS285 Lectures 11–18

L11–18 connect control as inference, LLM RL, model-based RL, and offline RL, with HW4 and HW5 providing two compute-intensive implementations.

Policy Gradients, Actor-Critic, DQN, and SAC | Berkeley CS285 Lectures 5–10

L5–10 build the deep-RL core through policy- and value-based routes; HW2 is CPU-friendly, while HW3's Atari and HalfCheetah runs can require hours of GPU time.

Deep Reinforcement Learning: From Decision Concepts to Policy Learning and Experiments | Berkeley CS285 Course Overview

Spring 2026 CS185/285 publishes slides for 25 lectures, nine discussion units, five assignments, and starter code; lecture recordings are public on the RAIL YouTube channel, but Ed, Gradescope, and office hours remain enrolled-only, while HW4 defaults to an H100, so this is not a zero-cost open course.