mlsanityData to 7 Oct 2026

Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-sum Objectives

arXiv 1804.10601 ↗First posted 27 Apr 2018cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Apr 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 2.

4 papers.