N-Step Returns in Reinforcement Learning

• N-step returns are defined as the sum of discounted rewards over n steps with a bootstrapped value, balancing bias and variance in reinforcement learning.
• They underpin both model-based evaluations and model-free TD algorithms, facilitating faster reward propagation and improved stability.
• Adaptive selection and mixture techniques of n-step returns enhance learning efficiency and control variance in practical deep RL implementations.

An $n$-step return is a fundamental target in temporal-difference (TD) and value-based reinforcement learning, consisting of the sum of discounted rewards over $n$ steps followed by a bootstrapped estimate of the value function at the $n$-th future state. This construction allows intermediate propagation of reward information, controlling the bias–variance trade-off between single-step TD learning and Monte Carlo evaluation. The use of $n$-step returns, their mixtures, and adaptive schemes for step-horizon selection underpin a vast array of modern RL algorithms, spanning off-policy learning, deep Q-networks, actor-critic architectures, and multi-goal learning.

1. Mathematical Definition and Construction

The $n$-step return for a trajectory $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$ is defined as follows: $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$ where $\gamma$ is the discount factor, $r_{t+k+1}$ are rewards, and $V(\cdot)$ is a bootstrapped value or action-value estimate. For off-policy learning, one applies importance-sampling correction: $n$0 with $n$1 the target policy and $n$2 the behavior policy. This structure is central in both value and Q-learning formulations, with the latter using: $n$3 (Lim et al., 13 Feb 2025, Chiang et al., 2020).

2. Algorithmic Frameworks: Model-Based and Model-Free

$n$4-step returns enable a spectrum of policy evaluation and control algorithms:

• Model-Based Policy Evaluation: The $n$5-step Bellman operator is

$n$6

with projection onto feature space and fixed points given by the $n$7-step projected Bellman equation. For large enough $n$8, the gain matrix $n$9 becomes Schur, yielding geometric convergence in both deterministic solvers and Richardson-type gradient iterations. Sufficient bounds for $n$0 exist for all contraction and Hurwitz criteria required for stability (Lim et al., 13 Feb 2025).

• Model-Free $n$1-Step TD Learning: In off-policy settings, stochastic approximation algorithms can update value parameters using samples over $n$2-step trajectories, with proven w.p.1 convergence for sufficiently large $n$3 and appropriate step-size schedules. Both i.i.d. and Markovian sampling converge to the fixed point of the model-based equation under mild conditions (Lim et al., 13 Feb 2025).
• Deep RL Extensions: Bootstrapped DQN variants assign each head in an ensemble a distinct $n$4 backup horizon, achieving diversity in target updates and improved exploration and sample efficiency. Mixture-based approaches further generalize via weighted targets or TD($n$5) (Chiang et al., 2020).

3. Bias–Variance Analysis and Return Mixtures

The $n$6-step return forms the basis of the trade-off between bias (from bootstrapping) and variance (from reward stochasticity):

• Bias: For small $n$7, bootstrapped value estimates dominate, increasing bias.
• Variance: For large $n$8, real rewards propagate more deeply but variance grows. In the limit $n$9, the return becomes unbiased but variance-limited (Monte Carlo).
• Compound and $n$0-Returns: Weighting or averaging $n$1-step returns (e.g., TD($n$2)) can strictly reduce variance for matched contraction properties, as formally proved under both linear and nonlinear settings. State-adaptive mixtures such as Confidence-based Autodidactic Returns outperform hand-tuned exponential mixtures by dynamically switching weights in response to learned confidence scores (Sharma et al., 2017, Daley et al., 2024).

Table: Comparison of $n$3-step Targets and Mixtures

Variant	Target Formula	Bias–Variance Effect
$n$4-step	$n$5	Bias $n$6, Variance $n$7 as $n$8 decreases
TD($n$9)	$n$0	Smooth trade-off via $n$1
Compound	$n$2	Lower variance for same bias

All bias–variance trade-offs are supported by the cited theoretical and empirical results (Daley et al., 2024, Sharma et al., 2017, Lim et al., 13 Feb 2025).

4. Off-Policy Corrections and Practical Stability

In off-policy multi-step learning, the divergence risk inherent in the “deadly triad” (function approximation + off-policy + bootstrapping) is mitigated by increasing $n$3:

• Contraction and Hurwitz: For finite $n$4, theoretical thresholds guarantee contraction of Bellman operators and geometric convergence as all relevant matrices become Schur or Hurwitz (Lim et al., 13 Feb 2025).
• Importance-Sampling Variants: Large $n$5 increases instability due to possible variance explosion in importance weights, motivating numerically stable schemes (e.g., quantile clipping in SAC$n$6 (Łyskawa et al., 15 Dec 2025)).
• Bias in Multi-goal Relabeling: In hindsight experience replay, naive $n$7-step relabeling introduces a bias that grows linearly in $n$8 and reward magnitude, requiring $n$9-mixtures or model-based blending to control bias in practical multi-goal learning (Yang et al., 2021).

5. Empirical Performance and Adaptive Selection of $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$0

Extensive experiments confirm:

• Accelerated Learning: Larger $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$1-step returns propagate rewards faster in deep RL, with mixture or compound approaches (e.g., MB-DQN, PiLaR) outperforming pure $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$2-step baselines (Chiang et al., 2020, Daley et al., 2024).
• Adaptive Step Length: The SDPSA algorithm adaptively finds an $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$3 minimizing average RMSE for TD($$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$4), with proven almost sure convergence to the optimal discrete $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$5, outperforming alternative bandit-style algorithms in controlled experiments (Mandal et al., 2023).
• Transformer-based Critics and Ensemble Methods: In continuous control, chunked $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$6-step targets substantially improve stability and sample efficiency in sparse- and multi-phase tasks, with gradient-level averaging over multiple horizons reducing critic variance (Tian et al., 5 Mar 2025).

6. Error Bounds and Theoretical Guarantees

Quantitative bounds depend critically on $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$7:

• Approximation Error: Under a contraction regime, the fixed-point mismatch $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$8 decays as $$(s_t, a_t, r_{t+1}, s_{t+1}, \ldots, r_{t+n}, s_{t+n})$$9.
• Finite-sample Guarantees: TD with compound returns achieves strictly better finite-sample complexity at fixed contraction modulus, offering lower upper bounds on estimation error as a function of variance and sample number (Daley et al., 2024, Lim et al., 13 Feb 2025).

When $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$0 is $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$1-contractive, explicit error bounds are available: $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$2 with convergence to the least-squares projection in the $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$3 limit (Lim et al., 13 Feb 2025).

7. Hyperparameter Choices, Practical Algorithms, and Recommendations

Algorithmic implementations require careful selection of horizon $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$4 and mixture weights, as well as numerically stable handling of importance ratios and reward/entropy estimation in actor-critic variants:

• Choice of $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$5: Logarithmic dependence of threshold $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$6 on feature conditioning, discount factor, and stationary distribution, as well as task-specific risk of divergence for small $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$7 (Lim et al., 13 Feb 2025, Mandal et al., 2023).
• Mixture Weights and Gradient Averaging: State-adaptive mixtures (e.g. CAR) and compound two-bootstrap mixtures (PiLaR) reduce variance cost-effectively; mixture strategies outperform static single-target baselines in DQN and PPO (Daley et al., 2024, Sharma et al., 2017).
• Stable Importance Sampling: Quantile-based clipping provides unbiased multi-step returns in off-policy continuous control, together with τ-sampled entropy estimators to balance variance (Łyskawa et al., 15 Dec 2025).

Table: Notable Empirical Results Across Domains

Algorithm/Class	Key Empirical Finding	Reference
MB-DQN	Faster learning, richer exploration	(Chiang et al., 2020)
CAR λ-Mixture	Up to 4.5× baseline score on Atari	(Sharma et al., 2017)
T-SAC Transformer Critic	2× sample efficiency in sparse RL	(Tian et al., 5 Mar 2025)
PiLaR Compound Return	Lower variance, higher final score	(Daley et al., 2024)
SDPSA	Optimal $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$8 achievable for RMSE	(Mandal et al., 2023)

References to Key Papers

• Analysis of Off-Policy $$G_t^{(n)} = \sum_{k=0}^{n-1} \gamma^k\,r_{t+k+1} + \gamma^n\,V(s_{t+n})$$9-Step TD-Learning with Linear Function Approximation (Lim et al., 13 Feb 2025)
• Mixture of Step Returns in Bootstrapped DQN (Chiang et al., 2020)
• Learning to Mix n-Step Returns: Generalizing lambda-Returns for Deep RL (Sharma et al., 2017)
• Averaging $\gamma$0-step Returns Reduces Variance in Reinforcement Learning (Daley et al., 2024)
• Chunking the Critic: Transformer-based SAC with N-Step Returns (Tian et al., 5 Mar 2025)
• SACn: Soft Actor-Critic with n-step Returns (Łyskawa et al., 15 Dec 2025)
• Bias-reduced Multi-step Hindsight Experience Replay (Yang et al., 2021)
• n-Step TD Learning with Optimal n (Mandal et al., 2023)

---

The $\gamma$1-step return and its generalizations remain central to the stability, efficiency, and adaptability of reinforcement learning algorithms. Their detailed mathematical properties, bias–variance interplay, and algorithmic implications across classical and deep RL domains establish them as indispensable methodology for both theoretical analysis and practical design.