IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04037328.html
   My bibliography  Save this paper

A Multilevel Stochastic Approximation Algorithm for Value-at-Risk and Expected Shortfall Estimation

Author

Listed:
  • Stéphane Crépey

    (LPSM (UMR_8001) - Laboratoire de Probabilités, Statistique et Modélisation - SU - Sorbonne Université - CNRS - Centre National de la Recherche Scientifique - UPCité - Université Paris Cité)

  • Noufel Frikha

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Azar Louzi

    (LPSM (UMR_8001) - Laboratoire de Probabilités, Statistique et Modélisation - SU - Sorbonne Université - CNRS - Centre National de la Recherche Scientifique - UPCité - Université Paris Cité)

Abstract

We propose a multilevel stochastic approximation (MLSA) scheme for the computation of the value-at-risk (VaR) and expected shortfall (ES) of a financial loss, which can only be computed via simulations conditional on the realization of future risk factors. Thus, the problem of estimating its VaR and ES is nested in nature and can be viewed as an instance of stochastic approximation problems with biased innovations. In this framework, for a prescribed accuracy $\varepsilon$, the optimal complexity of a nested stochastic approximation algorithm is shown to be of order $\varepsilon^{-3}$. To estimate the VaR, our MLSA algorithm attains an optimal complexity of order $\varepsilon^{-2-\delta}$ , where $\delta<1$ is some parameter depending on the integrability degree of the loss, while to estimate the ES, it achieves an optimal complexity of order $\varepsilon^{-2}|\ln{\varepsilon}|^2$. Numerical studies of the joint evolution of the error rate and the execution time demonstrate how our MLSA algorithm regains a significant amount of the performance lost due to the nested nature of the problem.

Suggested Citation

  • Stéphane Crépey & Noufel Frikha & Azar Louzi, 2025. "A Multilevel Stochastic Approximation Algorithm for Value-at-Risk and Expected Shortfall Estimation," Post-Print hal-04037328, HAL.
  • Handle: RePEc:hal:journl:hal-04037328
    DOI: 10.1007/s00780-025-00573-5
    Note: View the original document on HAL open archive server: https://hal.science/hal-04037328v3
    as

    Download full text from publisher

    File URL: https://hal.science/hal-04037328v3/document
    Download Restriction: no

    File URL: https://libkey.io/10.1007/s00780-025-00573-5?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:hal:journl:hal-04037328. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.