A Prospect-Theoretic Policy Gradient Framework for Behaviorally Nuanced Reinforcement Learning

Olivier Lepel, Anas Barakat
10/3/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Classical reinforcement learning (RL) typically assumes rational decision-making based on expected utility theory. However, this model has been shown to be empirically inconsistent with actual human preferences, as evidenced in psychology and behavioral economics. Cumulative Prospect Theory (CPT) provides a more nuanced model for human-based decision-making, capturing diverse attitudes and perceptions toward risk, gains, and losses. While prior work has integrated CPT with RL to solve CPT policy optimization problems, the understanding and impact of this formulation remain limited. Our contributions are as follows: (a) we derive a novel policy gradient theorem for CPT objectives, generalizing the foundational result in standard RL, (b) we design a model-free policy gradient algorithm for solving the CPT-RL problem, (c) we analyze our policy gradient estimator and prove asymptotic convergence of the algorithm to first-order stationary points, and (d) test its performance through simulations. Notably, our first-order policy gradient algorithm scales better than existing zeroth-order methods to larger state spaces. Our theoretical framework offers more flexibility to advance the integration of behavioral decision-making into RL.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lepel2024prospecttheoretic,
  title  = {A Prospect-Theoretic Policy Gradient Framework for Behaviorally Nuanced Reinforcement Learning},
  author = {Olivier Lepel and Anas Barakat},
  year   = {2024},
  eprint = {2410.02605},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.02605v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.02605.svg)](https://codeofpaper.com/paper/2410.02605)

Discussion