mlsanityData to 14 Oct 2026

Hitting time for Markov decision process

arXiv 2205.03476 ↗First posted 6 May 2022cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We define the hitting time for a Markov decision process (MDP). We do not use the hitting time of the Markov process induced by the MDP because the induced chain may not have a stationary distribution. Even it has a stationary distribution, the stationary distribution may not coincide with the (normalized) occupancy measure of the MDP. We observe a relationship between the MDP and the PageRank. Using this observation, we construct an MP whose stationary distribution coincides with the normalized occupancy measure of the MDP and we define the hitting time of the MDP as the hitting time of the associated MP.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 6 references that are in the map. First posted on arXiv 6 May 2022.

Builds on

2 of 6 references.

References · 2

  1. 2021Cross-Domain Imitation Learning via Optimal Transportcited by 49
  2. 2015Hitting Times in Markov Chains with Restart and their Application to Network Centralitycited by 3

Built on by

Not cited yet.