IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2604.14439.html

Multi periods mean-DCVaR optimization: a Recursive Neural Network resolution

Author

Listed:
  • J'er^ome Lelong

    (LJK)

  • V'eronique Maume-Deschamps

    (ICJ, PSPM)

  • William Thevenot

    (ICJ, PSPM)

Abstract

We study a discrete-time multi-period portfolio optimization problem under an explicit constraint on the Deviation Conditional Value-at-Risk (DCVaR), defined as the excess of Conditional Value-at-Risk over expected terminal wealth. The objective is to maximize expected return subject to a global tail-risk constraint, leading to a time-inconsistent precommitment problem. We propose a recurrent neural-network-based approach to approximate the optimal precommitment policy, which accommodates path-dependent risk constraints and highdimensional state dynamics without relying on dynamic programming. The explicit constraint formulation allows for exact penalty methods and provides a transparent notion of feasibility. The methodology is validated in a classical complete-market financial model and extended to a multi-period portfolio allocation problem in (re)insurance, capturing the long-term risk dynamics of insurance liabilities.

Suggested Citation

  • J'er^ome Lelong & V'eronique Maume-Deschamps & William Thevenot, 2026. "Multi periods mean-DCVaR optimization: a Recursive Neural Network resolution," Papers 2604.14439, arXiv.org.
  • Handle: RePEc:arx:papers:2604.14439
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2604.14439
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    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:arx:papers:2604.14439. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.