My Knowledge Base

Home

❯

3. Resource

❯

n Step TD

n-Step TD

Dec 10, 20251 min read

  • machine_learning/reinforcement_learning

Definition

V(St​)←V(St​)+α[Gt:t+n​−V(St​)] where Gt:t+n​ is the n-Step Return.

The n-step TD learning is a method that bridges the gap between TD and MC methods.

Examples

  • n=1: Temporal Difference Learning
  • n=∞: Monte Carlo Method

Larger n reduces bias but increases variance.


Graph View

  • Definition
  • Examples

Backlinks

  • Reinforcement Learning Note
  • n-step Off-Policy Learning

Created with Quartz v4.5.1 © 2025

  • GitHub
  • Discord Community