IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.05491.html

Asymptotically-informed neural networks for Black-Scholes implied volatility computation

Author

Listed:
  • Samira Amiriyan
  • Youness Boutaib

Abstract

The computation of Black-Scholes implied volatility is a fundamental task in quantitative finance, underpinning option valuation, model calibration and risk management. Although implied volatility is routinely used in practice, the inversion of the Black-Scholes pricing formula remains a challenging numerical problem, particularly in asymptotic regimes corresponding to extreme option prices, strikes or maturities, where the inverse map becomes highly sensitive to perturbations of the price. In this paper, we introduce a new family of asymptotically-informed neural-network architectures for implied-volatility computation. Exploiting the distinct behaviours of the Black-Scholes pricing function in different volatility regimes, we propose a family of architectures that learn a trainable partition of the price-log-moneyness domain through a system of gating functions and combines specialised local approximations of the implied-volatility function within each region. Extensive numerical experiments demonstrate that the proposed models consistently outperform standard feed-forward neural networks across a wide range of parameter domains, often by several orders of magnitude in relative accuracy while maintaining excellent generalisation properties. Furthermore, the neural-network outputs provide highly accurate initial guesses for a third-order Householder scheme, allowing near machine-precision implied-volatility computations after only two refinement iterations.

Suggested Citation

  • Samira Amiriyan & Youness Boutaib, 2026. "Asymptotically-informed neural networks for Black-Scholes implied volatility computation," Papers 2609.05491, arXiv.org.
  • Handle: RePEc:arx:papers:2609.05491
    as

    Download full text from publisher

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

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2609.05491. 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: arXiv administrators (email available below). General contact details of provider: https://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.