IDEAS home Printed from https://ideas.repec.org/p/fau/wpaper/wp2025_12.html
   My bibliography  Save this paper

Gradient-Based Reinforcement Learning for Dynamic Quantile

Author

Listed:
  • Lukas Janasek

    (Institute of Economic Studies, Charles University, Prague, Czech Republic)

Abstract

This paper develops a novel gradient-based reinforcement learning algorithm for solving dynamic quantile models with uncertainty. Unlike traditional approaches that rely on expected utility maximization, we focus on agents who evaluate outcomes based on specific quantiles of the utility distribution, capturing intratemporal risk attitudes via a quantile level ? ? (0, 1). We formulate a recursive quantile value function associated with time consistent dynamic quantile preferences in Markov decision process. At each period, the agent aims to maximize the quantile of a distribution composed of instantaneous utility combined with the discounted future value, conditioned on the current state. Next, we adapt the Actor-Critic framework to learn ?-quantile of the distribution and policy maximizing the ?-quantile. We demonstrate the accuracy and robustness of the proposed algorithm using an quantile intertemporal consumption model with known analytical solutions. The results confirm the effectiveness of our algorithm in capturing optimal quantile-based behavior and stability of the algorithm.

Suggested Citation

  • Lukas Janasek, 2025. "Gradient-Based Reinforcement Learning for Dynamic Quantile," Working Papers IES 2025/12, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, revised Jul 2025.
  • Handle: RePEc:fau:wpaper:wp2025_12
    as

    Download full text from publisher

    File URL: https://ies.fsv.cuni.cz/en/gradient-based-reinforcement-learning-dynamic-quantile
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Dynamic programming; Quantile preferences; Reinforcement learning;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    Statistics

    Access and download statistics

    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:fau:wpaper:wp2025_12. 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: Natalie Svarcova (email available below). General contact details of provider: https://edirc.repec.org/data/icunicz.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.