Analysis of Value Iteration Through Absolute Probability Sequences

Value Iteration is a widely used algorithm for solving Markov Decision Processes (MDPs). While previous studies have extensively analyzed its convergence properties, they primarily focus on convergence with respect to the infinity norm. In this work, we use absolute probability sequences to develop a new line of analysis and examine the algorithm’s convergence in terms of the $L^2$ norm, offering a new perspective on its behavior and performance.