Machine learning for option pricing
an empirical investigation of network architectures
Serena Della Corte (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Laurens Van Mieghem (Student TU Delft)
Antonis Papapantoleon (Foundation for Research and Technology - Hellas (FORTH), TU Delft - Electrical Engineering, Mathematics and Computer Science)
Jonas Papazoglou-Hennig (Technische Universität München)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We consider the supervised learning problem of learning the price of an option or the implied volatility given appropriate input data (model parameters) and corresponding output data (option prices or implied volatilities). The majority of articles in this literature considers a (plain) feedforward neural network architecture in order to connect the neurons used for learning the function mapping inputs to outputs. In this article, motivated by methods in image classification and recent advances in machine learning methods for PDEs, we investigate empirically whether and how the choice of network architecture affects the accuracy and training time of a machine learning algorithm. We find that highway-type network architectures achieve the best performance, when considering the mean squared error and the training time as criteria, within the considered parameter budgets for the Black–Scholes and Heston option pricing problems. Considering the transformed implied volatility problem, a simplified DGM variant achieves the lowest error among the tested architectures. We also carry out a capacity-normalized comparison for completeness, where all architectures are evaluated with an equal number of parameters. Finally, for the implied volatility problem, we additionally include experiments using real market data.