Sign inSign in
ConceptAI & ML

Bellman optimality equation

Recursive equations that relate the optimal value of a state to the optimal values of its successor states using maximization over actions.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • David Silver

    Google DeepMind · Undergraduate

    • 52:45Planning by Dynamic Programming — Policy & Value Iteration

Lectures that assume it

1

Connections

11

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.