Value Iteration: Take the Best Move, Sweep to Convergence
This lesson is part of the course
In this lesson
You run value iteration for Robo on a slippery floor: in every sweep each cell takes the better of left and right (MAX), the values climb towards the optimal V*, and a line chart of the largest change shows the convergence.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Multi-Armed Bandits: Sample Averages & the Incremental Update Locked
- Epsilon-Greedy: Explore or Exploit, Visit by Visit Locked
- Upper Confidence Bound (UCB): Optimism with a Bonus Locked
- Returns & Discounting: G = R + γR + γ²R + … Locked
- Bellman Expectation: Evaluate a Random Policy Sweep by Sweep Locked
- Value Iteration: Take the Best Move, Sweep to Convergence Locked
- Q-Learning by Hand: Eight Updates of a Q-Table Locked
- Policy Extraction: From V* to the Best Action, and Random vs Optimal Locked