EconPapers    
Economics at your fingertips  
 

Computing VaR and CVaR using stochastic approximation and adaptive unconstrained importance sampling

Bardou O., Frikha N. and Pagès G.
Additional contact information
Bardou O.: Laboratoire de Probabilités et Modèles aléatoires, UMR 7599, Université Pierre et Marie Curie and GDF Suez Research and Innovation Department, France. Email: olivier-aj.bardou@gdfsuez.com
Frikha N.: Laboratoire de Probabilités et Modèles aléatoires, UMR 7599, Université Pierre et Marie Curie and GDF Suez Research and Innovation Department, France. Email: noufel-externe.frikha@gdfsuez.com
Pagès G.: Laboratoire de Probabilités et Modèles aléatoires, UMR 7599, Université Pierre et Marie Curie, France. Email: gilles.pages@upmc.fr

Monte Carlo Methods and Applications, 2009, vol. 15, issue 3, 173-210

Abstract: Value-at-Risk (VaR) and Conditional-Value-at-Risk (CVaR) are two risk measures which are widely used in the practice of risk management. This paper deals with the problem of estimating both VaR and CVaR using stochastic approximation (with decreasing steps): we propose a first Robbins–Monro (RM) procedure based on Rockafellar–Uryasev's identity for the CVaR. Convergence rate of this algorithm to its target satisfies a Gaussian Central Limit Theorem. As a second step, in order to speed up the initial procedure, we propose a recursive and adaptive importance sampling (IS) procedure which induces a significant variance reduction of both VaR and CVaR procedures. This idea, which has been investigated by many authors, follows a new approach introduced in [Lemaire and Pagès, Unconstrained Recursive Importance Sampling, 2008]. Finally, to speed up the initialization phase of the IS algorithm, we replace the original confidence level of the VaR by a slowly moving risk level. We prove that the weak convergence rate of the resulting procedure is ruled by a Central Limit Theorem with minimal variance and its efficiency is illustrated on several typical energy portfolios.

Keywords: VaR; CVaR; stochastic approximation; Robbins–Monro algorithm; importance sampling; Girsanov (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
https://doi.org/10.1515/MCMA.2009.011 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bpj:mcmeap:v:15:y:2009:i:3:p:173-210:n:1

Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/mcma/html

DOI: 10.1515/MCMA.2009.011

Access Statistics for this article

Monte Carlo Methods and Applications is currently edited by Karl K. Sabelfeld

More articles in Monte Carlo Methods and Applications from De Gruyter
Bibliographic data for series maintained by Peter Golla ().

 
Page updated 2025-03-19
Handle: RePEc:bpj:mcmeap:v:15:y:2009:i:3:p:173-210:n:1