mlsanityData to 7 Oct 2026

Persistent-Transient Policy Evaluation for Markov Chains via Minimal Peripheral Quotients

arXiv 2602.00474 ↗First posted 31 Jan 2026stat.ML cs.LG cs.NAcited by 1

Not on the map. Why?

Abstract (arXiv)

We study fixed-policy evaluation for finite Markov chains that may be reducible and periodic. Classical evaluation methods with gain and bias decomposition are not always diagnostic: the gain records only invariant Ces`aro averages, while persistent phase-dependent behavior is absorbed into the bias together with genuinely transient effects. We identify the real peripheral invariant subspace K(P) of the transition matrix P as the source of this ambiguity. Quotienting by K(P) is the minimal exact quotient that removes all non-decaying modes and makes the remaining dynamics strictly stable. After choosing a gauge projection Pi with kernel K(P), the reward admits a unique decomposition r = g_Pi^star + (I-P)v_Pi^star, where g_Pi^star is a persistent regime profile and v_Pi^star is a gauge-fixed transient component. An exact comparison with classical normalized gain and bias shows that the new pair reallocates the same information so that all persistent modes are represented in g_Pi^star and v_Pi^star is transient. This decomposition reconstructs finite-horizon returns, recovers statewise average reward, admits a transient-cost interpretation, and yields a stable estimator under a generative model.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 27 references that are in the map. First posted on arXiv 31 Jan 2026.

Builds on

11 of 27 references.

References · 11

  1. 2020Learning and Planning in Average-Reward Markov Decision Processescited by 54
  2. 2021Average-Reward Off-Policy Policy Evaluation with Function Approximationcited by 30
  3. 2024Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPscited by 16
  4. 2025Near-Optimal Sample Complexity for MDPs via Anchoringcited by 11
  5. 2024Stochastic Approximation with Unbounded Markovian Noise: A General-Purpose Theoremcited by 10
  6. 2025A Non-Asymptotic Theory of Seminorm Lyapunov Stability: From Deterministic to Stochastic Iterative Algorithmscited by 9
  7. 2025Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learningcited by 6
  8. 2025Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processescited by 5
  9. 2024Markov Chain Variance Estimation: A Stochastic Approximation Approachcited by 2
  10. 2025Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysiscited by 2
  11. 2025Faster Fixed-Point Methods for Multichain MDPscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.