IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i1p431-458.html
   My bibliography  Save this article

A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP

Author

Listed:
  • Mehrdad Moharrami

    (Computer Science Department, University of Iowa, Iowa City, Iowa 52242)

  • Yashaswini Murthy

    (Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801; and Department of Electrical & Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801)

  • Arghyadip Roy

    (Mehta Family School of Data Science and Artificial Intelligence, Indian Institute of Technology Guwahati, Guwahati, Assam 781039, India)

  • R. Srikant

    (Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801; and Department of Electrical & Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801)

Abstract

We study the risk-sensitive exponential cost Markov decision process (MDP) formulation and develop a trajectory-based gradient algorithm to find the stationary point of the cost associated with a set of parameterized policies. We derive a formula that can be used to compute the policy gradient from (state, action, cost) information collected from sample paths of the MDP for each fixed parameterized policy. Unlike the traditional average cost problem, standard stochastic approximation theory cannot be used to exploit this formula. To address the issue, we introduce a truncated and smooth version of the risk-sensitive cost and show that this new cost criterion can be used to approximate the risk-sensitive cost and its gradient uniformly under some mild assumptions. We then develop a trajectory-based gradient algorithm to minimize the smooth truncated estimation of the risk-sensitive cost and derive conditions under which a sequence of truncations can be used to solve the original, untruncated cost problem.

Suggested Citation

  • Mehrdad Moharrami & Yashaswini Murthy & Arghyadip Roy & R. Srikant, 2025. "A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP," Mathematics of Operations Research, INFORMS, vol. 50(1), pages 431-458, February.
    • Handle: RePEc:inm:ormoor:v:50:y:2025:i:1:p:431-458
    DOI: 10.1287/moor.2022.0139
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0139
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.0139?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:50:y:2025:i:1:p:431-458. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.