Author
Listed:
- Rudy Morel
(DI-ENS - Département d'informatique - ENS-PSL - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - Inria - Institut National de Recherche en Informatique et en Automatique - CNRS - Centre National de la Recherche Scientifique)
- Stéphane Mallat
(DI-ENS - Département d'informatique - ENS-PSL - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - Inria - Institut National de Recherche en Informatique et en Automatique - CNRS - Centre National de la Recherche Scientifique, Collège de France - Chaire Sciences des données - CdF (institution) - Collège de France)
- Jean-Philippe Bouchaud
(CFM - Capital Fund Management)
Abstract
We introduce a Path Shadowing Monte Carlo method, which provides the prediction of future paths, given any generative model. At any given date, it averages future quantities over generated price paths whose past history matches, or ‘shadows', the actual (observed) history. We test our approach using paths generated from a maximum entropy model of financial prices, based on a recently proposed multi-scale analogue of the standard skewness and kurtosis called ‘Scattering Spectra'. This model promotes the diversity of generated paths while reproducing main statistical properties of financial prices, including stylized facts such as volatility roughness. Our method yields state-of-the-art predictions for future realized volatility and allows one to determine conditional option smiles for the S&P500 that outperform both the most recent low-parametric models and the option market itself. The code is available at https://github.com/RudyMorel/shadowing (This work is supported by the PRAIRIE 3IA Institute of the French ANR-19-P3IA-0001 program and the ENS-CFM models and data science chair.).
Suggested Citation
Rudy Morel & Stéphane Mallat & Jean-Philippe Bouchaud, 2024.
"Path shadowing Monte Carlo,"
Post-Print
hal-04993695, HAL.
Handle:
RePEc:hal:journl:hal-04993695
DOI: 10.1080/14697688.2024.2399285
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
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:hal:journl:hal-04993695. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.