ConceptSystems & CS
-greedy algorithm
An algorithm that mostly acts greedily with probability while selecting a random action with probability , resulting in linear total regret.
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
3Each in their own terms, from the easiest level.
David J. Malan
An algorithm where a small probability epsilon determines whether to make a random move or choose the highest-valued option.Brian Yu
A strategy for balancing exploration and exploitation by choosing the best estimated move most of the time while occasionally taking random exploratory actions with probability .
Connections
8The lectures that define it or assume it, and the concepts next to it.