Seyed Masoud Hosseini · Overview · Study log · Ideas · Transcript · RSS feed

Deep Reinforcement Learning · Lecture 48 of 99 · 6:53

Lecture 11, Part 4: Planning with Uncertainty-Aware Models

CS 285: Lecture 11, Part 4 on YouTube

Study guide

What this lecture covers

This part closes out the uncertainty-aware modeling discussion from Part 3 by showing exactly how to plan using an ensemble of uncertainty-aware dynamics models, then reviews experimental evidence that this matters a great deal in practice. It's the practical payoff of the epistemic uncertainty machinery just introduced.

After watching, you'll be able to describe the sampling procedure for evaluating a candidate action sequence's expected reward across an ensemble of models, and you'll know the rough magnitude of improvement uncertainty-aware planning produced in real reported experiments.

Key ideas

  • Averaging reward across models: instead of optimizing reward under one dynamics model, optimize the average reward across N sampled models (or the full ensemble), each contributing its own predicted trajectory.
  • Sampling procedure: for a candidate action sequence, sample a model from the posterior (e.g. pick one ensemble member), roll out states through it, compute the reward, and repeat to average over models.
  • Compatible with standard planners: this scheme plugs into random shooting, CEM, or (with extra machinery like the reparameterization trick, covered later) LQR-style methods.
  • Large empirical gains: on HalfCheetah, adding bootstrap-ensemble epistemic uncertainty to model-based RL version 1.5 raised reward from around 500 to over 6,000 in a similar amount of training time.
  • Real-world robotic result: an in-hand manipulation robot using an ensemble-based model-based RL method learned to reliably rotate objects in its palm within a few hours of real-world interaction.

Walkthrough

How to plan with uncertainty (0:12)

The lecture extends the standard planning objective (sum of rewards over a horizon under one model) to an ensemble setting: optimize the action sequence that maximizes reward averaged over multiple sampled models. The described procedure samples a model from the posterior (trivial with a bootstrap ensemble — just pick one member), rolls out predicted states and rewards under it, and repeats across models and time steps to accumulate the average reward for a candidate action sequence, which is then optimized with a standard method like random shooting or CEM.

Example: model-based RL with ensembles (4:02)

Referencing the paper "Deep Reinforcement Learning in a Handful of Trials," the lecture reports that adding bootstrap-ensemble epistemic uncertainty raised HalfCheetah reward from roughly 500 (version 1.5 without uncertainty) to over 6,000, in comparable training time — a dramatic demonstration that uncertainty awareness matters most in low-data regimes.

More recent example: PDDM (4:41)

A real-world robotic hand manipulation experiment is described, using an ensemble-based model-based RL method (PDDM) to learn in-hand object rotation directly from interaction, reaching a reliable full 180-degree turn after a few hours of real-world training.

Further readings (5:40)

The lecture points to several further readings: PILCO (Deisenroth), an older foundational paper using Gaussian processes that established the importance of epistemic uncertainty in model-based RL; the "handful of trials" ensemble paper; and papers combining models with value functions and integrating epistemic uncertainty at multiple points in the pipeline.

Before you watch

  • Watch Lecture 11, Part 3 first for the definition of epistemic uncertainty and how bootstrap ensembles approximate the model posterior.
  • Recall the model-based RL version 1.5 (MPC) procedure from Part 1, since this part directly extends its planning step.

Check your understanding

  1. How does planning with an ensemble of models change the objective being optimized, compared to planning with a single model?
  2. Describe the steps of the sampling procedure used to estimate the expected reward of a candidate action sequence under model uncertainty.
  3. By roughly how much did epistemic uncertainty estimation improve HalfCheetah performance in the reported experiment, and what does that suggest about when uncertainty matters most?
  4. What real-world task did the PDDM-style robotic hand experiment demonstrate, and how long did learning take?
  5. Which planning methods can this ensemble-averaging approach be combined with, according to the lecture?

Chapters

← Lecture 11, Part 3: Estimating Epistemic Uncertainty with Neural Networks · Lecture 11, Part 5: Model-Based RL with Image Observations →