IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1811.05741.html
   My bibliography  Save this paper

Stochastic Algorithmic Differentiation of (Expectations of) Discontinuous Functions (Indicator Functions)

Author

Listed:
  • Christian P. Fries

Abstract

In this paper, we present a method for the accurate estimation of the derivative (aka.~sensitivity) of expectations of functions involving an indicator function by combining a stochastic algorithmic differentiation and a regression. The method is an improvement of the approach presented in [Risk Magazine April 2018]. The finite difference approximation of a partial derivative of a Monte-Carlo integral of a discontinuous function is known to exhibit a high Monte-Carlo error. The issue is evident since the Monte-Carlo approximation of a discontinuous function is just a finite sum of discontinuous functions and as such, not even differentiable. The algorithmic differentiation of a discontinuous function is problematic. A natural approach is to replace the discontinuity by continuous functions. This is equivalent to replacing a path-wise automatic differentiation by a (local) finite difference approximation. We present an improvement (in terms of variance reduction) by decoupling the integration of the Dirac delta and the remaining conditional expectation and estimating the two parts by separate regressions. For the algorithmic differentiation, we derive an operator that can be injected seamlessly - with minimal code changes - into the algorithm resulting in the exact result.

Suggested Citation

  • Christian P. Fries, 2018. "Stochastic Algorithmic Differentiation of (Expectations of) Discontinuous Functions (Indicator Functions)," Papers 1811.05741, arXiv.org, revised Nov 2019.
  • Handle: RePEc:arx:papers:1811.05741
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Jiun Hong Chan and Mark Joshi, 2012. "Optimal Limit Methods for Computing Sensitivities of," Department of Economics - Working Papers Series 1142, The University of Melbourne.
    2. Christian P. Fries, 2017. "Automatic Backward Differentiation for American Monte-Carlo Algorithms (Conditional Expectation)," Papers 1707.04942, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frazier, David T. & Oka, Tatsushi & Zhu, Dan, 2019. "Indirect inference with a non-smooth criterion function," Journal of Econometrics, Elsevier, vol. 212(2), pages 623-645.

    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:1811.05741. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.