paper-with-me

Papers

Behavior-Induced Mirror-Prox Temporal-Difference Learning for Faster Off-Policy Prediction

2026-05-16 · Xingguo Chen, Yuchen Shen, Shangdong Yang, Chao Li, Guang Yang, Wenhao Wang 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.

📄 PDF Abstract BibTeX arXiv:2605.28849

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data

2025-12-30 · Wenye Li, Hongxu Chen, Jiacai Liu, Ke Wei arxiv

This paper studies the policy mirror descent (PMD) method, which is a general policy optimization framework in reinforcement learning and can cover a wide range of policy gradient methods by specifying difference mirror …

Reinforcement Learning

On Convergence of some Gradient-based Temporal-Differences Algorithms for Off-Policy Learning

2017-12-27 · Huizhen Yu

We consider off-policy temporal-difference (TD) learning methods for policy evaluation in Markov decision processes with finite spaces and discounted reward criteria, and we present a collection of convergence results fo…

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm

2023-12-14 · Vishwak Srinivasan, Andre Wibisono, Ashia Wilson

We propose a new method called the Metropolis-adjusted Mirror Langevin algorithm for approximate sampling from distributions whose support is a compact and convex set. This algorithm adds an accept-reject filter to the M…

On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation

2025-09-23 · Jiacai Liu, Wenye Li, Ke Wei arxiv

Policy mirror descent (PMD) is a general policy optimization framework in reinforcement learning, which can cover a wide range of typical policy optimization methods by specifying different mirror maps. Existing analysis…

Reinforcement Learning

A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximation

2018-06-06 · Jalaj Bhandari, Daniel Russo, Raghav Singal

Temporal difference learning (TD) is a simple iterative algorithm used to estimate the value function corresponding to a given policy in a Markov decision process. Although TD is one of the most widely used algorithms in…

Q-LearningReinforcement Learning