Skip to main content
Theorem
Path
Curriculum
Paths
Labs
Diagnostic
Case Study
Blog
Search
Sign in
Pulse
/
Reinforcement Learning
Reinforcement Learning Pulse
Five questions across 6 topics. No timer.
1 / 5
Reinforcement Learning
Question 1 of 5
foundation (2/10)
compute
ϵ
-greedy exploration is a simple strategy. What does it do?
Hide and think first
A.
With probability
ϵ
pick a random action; otherwise pick the action with the highest estimated value
B.
Always picks the action with the highest value, ignoring exploration entirely
C.
Picks actions proportionally to their estimated values via softmax
D.
Randomly selects between two predefined actions, regardless of state
Submit Answer
I don't know