Behavior-Induced Mirror-Prox Temporal-Difference Learning for Faster Off-Policy Prediction
Not on the map. Why?
Abstract (arXiv)
Gradient temporal-difference methods provide stable off-policy prediction with linear function approximation, but their practical performance is strongly affected by the geometry induced by the auxiliary-variable metric. Existing Mirror-Prox TD methods typically use the feature covariance metric, whereas hybrid TD methods suggest that behavior-policy transition information can provide a more informative update geometry. This paper proposes a behavior-induced Mirror-Prox temporal-difference method, called STHTD-MP, which replaces the covariance metric in the primal-dual saddle-point formulation with the symmetric part of the behavior-policy Bellman matrix. The method keeps a single learning rate for the primal and auxiliary variables and applies a Mirror-Prox prediction-correction step to the resulting hybrid saddle-point operator. We provide a formal convergence analysis for fixed-policy linear prediction under standard stochastic approximation assumptions: the behavior-induced metric is positive definite, the joint mean system is Hurwitz, boundedness follows from a Lyapunov argument, and the stochastic recursion converges by the ODE method. We further derive projected-oracle ergodic gap bounds and an exact mean-operator comparison with GTD2-MP based on the spectral radius of the deterministic Mirror-Prox error matrix. The analysis shows that STHTD-MP can have a smaller mean contraction factor than GTD2-MP when the behavior-induced metric improves the saddle-point geometry. Exact numerical mean-operator analysis on two-state, Random Walk, and Boyan Chain benchmarks supports this condition, while Baird's counterexample is identified as a singular boundary case where the strict assumptions fail.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 24 references that are in the map. First posted on arXiv 16 May 2026.
Builds on
7 of 24 references.
References · 7
- 2019Minimax Weight and Q-Function Learning for Off-Policy Evaluationcited by 150
- 2020Finite Time Analysis of Linear Two-timescale Stochastic Approximation with Markovian Noisecited by 52
- 2021Breaking the Deadly Triad with a Target Networkcited by 47
- 2020Gradient Temporal-Difference Learning with Regularized Correctionscited by 38
- 2020Finite-Sample Analysis of Proximal Gradient TD Algorithmscited by 32
- 2019Finite-Time Analysis and Restarting Scheme for Linear Two-Time-Scale Stochastic Approximationcited by 18
- 2020Proximal Gradient Temporal Difference Learning: Stable Reinforcement Learning with Polynomial Sample Complexitycited by 7
Built on by
Not cited yet.