Non-maximizing policies that fulfill multi-criterion aspirations in expectation
Simon Dima, Simon Fischer, Jobst Heitzig, Joss Oliver

TL;DR
This paper introduces a novel approach for sequential decision making in stochastic environments that ensures multiple criteria meet specified aspirations without maximizing a single reward, reducing unintended behaviors.
Contribution
It proposes an algorithm for finite acyclic MDPs that guarantees aspiration satisfaction across multiple metrics using convex set approximations, avoiding reward maximization.
Findings
Algorithm guarantees aspiration fulfillment in polynomial time.
Explicitly non-maximizing policies allow for safety heuristics.
Method applies to multi-criteria decision-making in stochastic settings.
Abstract
In dynamic programming and reinforcement learning, the policy for the sequential decision making of an agent in a stochastic environment is usually determined by expressing the goal as a scalar reward function and seeking a policy that maximizes the expected total reward. However, many goals that humans care about naturally concern multiple aspects of the world, and it may not be obvious how to condense those into a single reward function. Furthermore, maximization suffers from specification gaming, where the obtained policy achieves a high expected total reward in an unintended way, often taking extreme or nonsensical actions. Here we consider finite acyclic Markov Decision Processes with multiple distinct evaluation metrics, which do not necessarily represent quantities that the user wants to be maximized. We assume the task of the agent is to ensure that the vector of expected…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEconomic Policies and Impacts
