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

Tradable It\^o Signatures: A Model-Free, Interpretable Framework for Dynamic Hedging

Author

Listed:
  • Xin Guo
  • Binnan Wang
  • Ruixun Zhang

Abstract

We propose an interpretable machine-learning framework for dynamic hedging using the It\^o signature transform, which turns asset-price paths into a set of linear features that universally represent nonlinear functions on time-series. We show that each discretized It\^o signature component can be perfectly replicated by a simple self-financing strategy using only the underlying assets and cash, which turns It\^o signature components into tradable and transparent hedging bases. This allows nonlinear derivative payoffs to be approximated by linear combinations of signature terms and hedged through the corresponding combination of trading strategies. We further establish a new approximation result for the It\^o signature and derive theoretical bounds for both in-sample and out-of-sample hedging errors. Our method is computationally efficient, easy to implement, and avoids the estimation of future conditional expectations, which makes it attractive for real-world applications. In simulations, our method delivers strong sample efficiency at substantially lower computational cost than neural-network benchmarks. In an empirical study of S\&P 500 index options, it performs robustly across vanilla and path-dependent contracts, with the signature-kernel weighted version providing further gains by localizing estimation to similar historical market paths. Overall, the paper identifies the It\^o signature as a practical, transparent, and model-agnostic implementation framework for dynamic hedging.

Suggested Citation

  • Xin Guo & Binnan Wang & Ruixun Zhang, 2026. "Tradable It\^o Signatures: A Model-Free, Interpretable Framework for Dynamic Hedging," Papers 2608.18120, arXiv.org.
  • Handle: RePEc:arx:papers:2608.18120
    as

    Download full text from publisher

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

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