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

Title:
A Multilevel Stochastic Approximation Algorithm for Value-at-Risk and Expected Shortfall Estimation
Contributors:
Laboratoire de Probabilités, Statistique et Modélisation (LPSM (UMR_8001)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Centre d'économie de la Sorbonne (CES), Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS), The research of S. Crépey has benefited from the support of the Chair Capital Markets Tomorrow: Modeling and Computational Issues under the aegis of the Institut Europlace de Finance, a joint initiative of Laboratoire de Probabilités, Statistique et Modélisation (LPSM) / Université Paris Cité and Crédit Agricole CIB.The research of N. Frikha has benefited from the support of the Institut Europlace de Finance.
Publisher Information:
HAL CCSD
Publication Year:
2023
Collection:
Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe)
Document Type:
Report report
Language:
English
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edsbas.BF979B1B
Database:
BASE

Weitere Informationen

We propose a multilevel stochastic approximation (MLSA) scheme for the computation of the Value-at-Risk (VaR) and the 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 a stochastic approximation problem with biased innovation. In this framework, for a prescribed accuracy ε, the optimal complexity of a standard stochastic approximation algorithm is shown to be of order ε −3. To estimate the VaR, our MLSA algorithm attains an optimal complexity of order ε −2−δ , where δ < 1 is some parameter depending on the integrability degree of the loss, while to estimate the ES, it achieves an optimal complexity of order ε −2 |ln ε| 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 lost performance due to the nested nature of the problem.