
Value Functions in Reinforcement Learning: Predicting Future Reward
A reward tells you what just happened. A value function predicts the return you can expect from here to the end of the episode—and that forward-looking…
Read tutorialTurn experience into predictions about future outcomes, then connect value, action value, advantage, and Bellman relationships to observable decisions.
Tutorials
Follow the learning path in order or jump directly to the RL concept or experiment you need.

A reward tells you what just happened. A value function predicts the return you can expect from here to the end of the episode—and that forward-looking…
Read tutorial
The first time you see the Bellman equation, it looks like a symbol puzzle. Greek letters, nested expectations, a value function that seems to appear on…
Read tutorial
You're reading an actor-critic explanation and you hit three symbols: V, Q, and A. The critic estimates V. The policy gradient weights updates by A.…
Read tutorial
The real difference between model-based and model-free reinforcement learning is not how much the agent learns. It is whether the agent can predict what…
Read tutorial
The agent-environment loop feels simple until you try to make an algorithm learn. Then the loop stops being enough. The agent needs to know what it can…
Read tutorial
A Bellman equation states a consistency condition. A Bellman backup is the mechanical step that enforces it. The difference between reading an equation and…
Read tutorial
Scoring a policy and improving a policy feel like the same job. They are not. One is a measurement. The other is a search. Confusing them is one of the…
Read tutorial
An agent that only learns from real experience is sample-hungry. An agent that trusts its own imagined experience can be confidently wrong. Planning with a…
Read tutorial
You can name the parts of an MDP. States, actions, rewards, transitions—you have the vocabulary down. But if I ask you what the environment model actually…
Read tutorial
Value iteration is not a loop that guesses better. It is a machine that shrinks the distance between any two value estimates by a factor of gamma on every…
Read tutorial
You can compute value estimates. You can trace a Bellman backup through a small grid. But if someone asked you to explain how those numbers actually change…
Read tutorial
A model that predicts the next state almost perfectly can still produce plans that drift into nonsense after a few imagined steps. The mistake is treating…
Read tutorial
Two actions can offer the same expected return and still feel completely different to the agent that takes them. One delivers a steady, predictable…
Read tutorial
Every real transition in a Dyna-style agent does two jobs at once: it teaches the value learner and it teaches the model. Then the model becomes a second…
Read tutorial
A policy that acts on the latest observation alone is guessing. A belief state is how you stop guessing.
Read tutorial
A flat policy re-decides everything, every step. Options let it decide once and commit.
Read tutorial
A flat agent that learns the easy part of a long task and then stalls is not asking for a hierarchy. It is asking for a diagnosis.
Read tutorial
Your agent has no finish line. No terminal state ends the run, no episode boundary resets the world, and no natural horizon cuts the future off. You reach…
Read tutorial
A ten-step plan is a promise your model cannot keep. Execute step one, measure what actually happened, and throw the other nine away.
Read tutorial
The agent plans beautifully for five steps. Then the imagined future quietly stops matching reality, and the only knob you reach for is horizon length.
Read tutorial