Sign inSign in
ConceptAI & ML

Natural policy gradient

A policy gradient method that multiplies the regular gradient by the inverse of the Fisher Information Matrix to correctly account for parameter sensitivities.
as Sergey Levine defines itUC BerkeleyThe wording closest to all 3 definitions
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

2

Each in their own terms, from the easiest level.

  • Sergey Levine

    UC Berkeley · Undergraduate

    • 10:05Exploration of deep reinforcement learning architectures and algorithms
  • David Silver

    Google DeepMind · Undergraduate

    A parametrisation-independent gradient ascent direction that finds the steepest ascent step measured using the Fisher information matrix.

Connections

8

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

2 lecturers. 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.