Sign inSign in
ConceptAI & ML

Epsilon-greedy exploration

A simple exploration strategy where the agent mostly chooses the greedy action with probability 1−ϵ1 - \epsilon, but takes a uniform random action with probability ϵ\epsilon.
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.

Exploration1Greedy policy1

Lecturers

1

    Connections

    2

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

    Concept1

    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.