# Minimizing the Outage Probability in a Markov Decision Process

arXiv: https://arxiv.org/abs/2302.14714 · HTML: https://mlsanity.com/paper/2302.14714/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 9 references that are in the map.
- First posted on arXiv 28 Feb 2023.

## Builds on (most cited first, 1 of 1)

- [A Distributional Perspective on Reinforcement Learning](https://mlsanity.com/paper/1707.06887/) (2017)

## Abstract (arXiv)

Standard Markov decision process (MDP) and reinforcement learning algorithms optimize the policy with respect to the expected gain. We propose an algorithm which enables to optimize an alternative objective: the probability that the gain is greater than a given value. The algorithm can be seen as an extension of the value iteration algorithm. We also show how the proposed algorithm could be generalized to use neural networks, similarly to the deep Q learning extension of Q learning.