IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i4p2129-2155.html
   My bibliography  Save this article

Nonasymptotic Convergence Rates for the Plug-in Estimation of Risk Measures

Author

Listed:
  • Daniel Bartl

    (Department of Mathematics, Vienna University, 1010 Vienna, Austria)

  • Ludovic Tangpi

    (Operations Research and Financial Engineering, Bendheim Center for Finance, Princeton University, Princeton, New Jersey 08544)

Abstract

Let ρ be a general law-invariant convex risk measure, for instance, the average value at risk, and let X be a financial loss, that is, a real random variable. In practice, either the true distribution μ of X is unknown, or the numerical computation of ρ ( μ ) is not possible. In both cases, either relying on historical data or using a Monte Carlo approach, one can resort to an independent and identically distributed sample of μ to approximate ρ ( μ ) by the finite sample estimator ρ ( μ N ) ( μ N denotes the empirical measure of μ ). In this article, we investigate convergence rates of ρ ( μ N ) to ρ ( μ ) . We provide nonasymptotic convergence rates for both the deviation probability and the expectation of the estimation error. The sharpness of these convergence rates is analyzed. Our framework further allows for hedging, and the convergence rates we obtain depend on neither the dimension of the underlying assets nor the number of options available for trading.

Suggested Citation

  • Daniel Bartl & Ludovic Tangpi, 2023. "Nonasymptotic Convergence Rates for the Plug-in Estimation of Risk Measures," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2129-2155, November.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:2129-2155
    DOI: 10.1287/moor.2022.1333
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1333
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1333?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:4:p:2129-2155. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.