← Latest papers
🤖 machine learning

On the Variance of Temporal Difference Learning and its Reduction Using Control Variates

This paper analyzes the variance of temporal difference learning in a tabular setting, demonstrating that its variance reduction stems from aggregating independent trajectories, establishing that TD variance is asymptotically bounded by Monte Carlo estimators and decreases with shorter horizons, while showing that Direct Advantage Estimation achieves even tighter variance bounds through a regression-adjusted control variate approach.

Original authors: Hsiao-Ru Pan, Bernhard Schölkopf

Published 2026-06-19
📖 4 min read☕ Coffee break read

Original authors: Hsiao-Ru Pan, Bernhard Schölkopf

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to guess the average temperature of a city over the next year. You have two main ways to do this:

  1. The "Wait and See" Method (Monte Carlo): You wait until the year is over, collect every single daily temperature, and calculate the average. This is accurate (unbiased), but it takes a long time, and if you only have a few years of data, your guess might swing wildly depending on whether you got a hot summer or a cold one.
  2. The "Guess and Update" Method (Temporal Difference or TD): You make a guess for today, then tomorrow you look at the actual temperature and your previous guess to update your estimate. You don't wait for the whole year to end. This is faster, but because you are relying on your own previous guesses (which might be wrong), people often worry it might be "noisy" or unstable.

This paper, written by Hsiao-Ru Pan and Bernhard Schölkopf, dives deep into why the "Guess and Update" method (TD) is often less "noisy" than people think, and how to make it even quieter.

The Big Surprise: Why "Guessing" is Actually Calmer

For a long time, experts thought TD learning was less noisy because it "shortcuts" the future by using its own estimates (a process called bootstrapping). The paper argues there is a second, more powerful reason: Crowd Wisdom.

Imagine you are trying to guess the temperature of a specific park.

  • Monte Carlo asks 10 people to walk the whole park and report the average.
  • TD asks 10 people to walk just the first 10 steps, then asks them to look at a map (their previous estimate) to guess the rest.

The paper shows that TD is actually gathering information from a much larger pool of imaginary paths. Even though each person only walks a short distance, the math of TD effectively combines the data from many different potential paths that those short walks could have led to. It's like TD is secretly averaging the opinions of a huge crowd, which smooths out the noise.

The Catch: This only works if the "map" (the previous estimates) is based on diverse paths. If everyone walks the exact same path and looks at the exact same spot on the map, TD loses its advantage and becomes just as noisy as the "Wait and See" method.

The Secret Weapon: The "Advantage" Cheat Sheet

The paper introduces a clever trick to make these estimates even better, using a concept called Control Variates.

Think of it like this: You are trying to guess the total cost of a road trip.

  • The Problem: Gas prices fluctuate wildly (noise).
  • The Trick: You know exactly how much the car should cost to drive based on the distance (the "Advantage"). You subtract this known, predictable cost from your total estimate.

By removing the predictable part of the equation, you are left with only the unpredictable part. Since the predictable part is gone, the remaining "noise" is much smaller.

The paper proves that a method called Direct Advantage Estimation (DAE) does exactly this. It simultaneously guesses the total value (the trip cost) and the "Advantage" (the predictable part). By using the Advantage as a "control variate" (a reference point to cancel out noise), DAE creates a much tighter, more stable estimate than standard TD learning.

What the Experiments Showed

The authors tested these ideas in a simple, maze-like game:

  1. Perfect World: When the game was perfectly predictable (no random events), standard TD learning didn't get any quieter than the "Wait and See" method. This confirmed their theory: if the paths aren't diverse, the "crowd wisdom" trick fails.
  2. Random World: When they added random events (like sticky floors or masked rewards), TD started to shine. The randomness forced the agents to take different paths, allowing TD to aggregate more diverse data and reduce noise.
  3. The DAE Winner: In almost every scenario, the new method (DAE) was the calmest and most accurate. Even when the data was sparse (not enough information to perfectly guess the "Advantage"), DAE still managed to be better than standard TD, proving that this "noise-canceling" technique is very robust.

The Bottom Line

This paper explains that Temporal Difference learning is less noisy not just because it shortcuts the future, but because it effectively averages over a massive number of potential paths. Furthermore, by using a method called Direct Advantage Estimation, we can treat the predictable parts of a problem as a "control" to cancel out the noise, resulting in a much more stable and accurate learning process.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →