1. Introduction
The most remarkable scientific breakthrough in recent years is the creation of super-human intelligence via deep neural networks in the field of artificial intelligence (AI) (
Silver et al. 2016,
2017,
2018;
Tian et al. 2019). Additionally, the availability of Big Data is opening a new field of data analytics. Given the enormous scale and complexity of data, a manual human analysis is impossible. Therefore, machine learning (ML) is applied in order to extract the relevant information from data.
We utilize the tools of AI and apply them to finance, particularly on pricing financial derivatives. This paper focuses on a certain financial derivative, namely options. There is a diverse array of options such as American options, European options or Exotic options. With the aim to simplify the subsequent analysis, we first study plain vanilla call- and put-options. A call(put)-option gives the holder the right to buy (sell) an underlying asset at a specified strike price and time in the future. Note, European options can only be exercised at the end of maturity, while American-type options can be exercised at any time.
The theoretical methodology of option pricing follows the well-known Black–Scholes (BS) model (
Black and Scholes 1973). Although the model is influential, it is held back by simplified assumptions on stock market dynamics, constant variance, no transaction costs, continuous trading, no-arbitrage and complete markets. Moreover, the Black–Scholes model is sometimes lacking closed-form analytical solutions. Generally, a violation of the assumptions leads to deviations from the market price (
Liu and Wang 2013).
In order to circumvent the limitations of Black–Scholes theory, we apply a reverse engineering (RE) approach. In short, we use market data in order to search for an option pricing formula by utilizing a new AI-methodology. This approach is called ‘reverse’ because we start with data amid to obtain a pricing formula at the end. We gather the same market input data as for the Black–Scholes model, such as current stock price, strike price, time to maturity, volatility and the risk-free interest rate. Our data contain more than 5615 call-options and 5173 put-options of mainly American-type from the German stock market—in-short DAX. In this paper, we apply so-called genetic algorithms (GA), and optimize the input data with the target to infer a functional relationship that captures the true market price of options.
1The application of genetic algorithms is highly effective in search and optimisation problems (
Mitchell 1996). Simply put when given data, GA is finding a function that fits the relationship between all inputs and the output with the smallest root mean square error. The inputs are the Black–Scholes input variables and the outputs are the option prices in the market. At first, the GA generates several non-linear functions and calculates via iterations the function with the lowest root mean square error (or mean absolute error). As the GA proceeds action, it adapts towards the global optimal functional-type (
Brabazon et al. 2008).
The main findings are: first the option pricing formula of reverse engineering is different to the Black–Scholes solution, particularly because it does not contain a normal probability distribution function. Second, the numerical evaluation of the RE model statistically yields a lower root mean square error to the market price. Nonetheless, the pricing of the RE model is not always more plausible than the Black–Scholes model, especially if we are pricing options dissimilar to our training data. This demonstrates that the RE model is heavily reliant on training data. Indeed, pricing options from other markets lead to insufficient results because the RE-formula is not trained by foreign option characteristics.
No doubt, reverse engineering is a novel methodology in the toolbox of modern finance, in particular for solving complex and dynamic problems. Even though the application of AI is promising, our study reveals that it is not devoid of imperfections.
The paper is structured as follows.
Section 2 summarizes the relevant literature.
Section 3 describes the data, AI-methodology, and option theory. The results are discussed in
Section 4.
Section 5 concludes the paper.
2. Literature Review
This paper is related to at least two areas in economic literature. First, the finance literature about option pricing. The most widely used formula for calculating the price of an option is the Black–Scholes model (
Black and Scholes 1973). The standard Black–Scholes model assumes ‘ideal’ market conditions. That means no transaction costs, market efficiency, no dividend pay-outs, a constant volatility and a risk-free interest rate as well as stock dynamics that follow a geometric Brownian motion.
According to empirical research, the Black–Scholes model reveals systematic deviation between the theoretical and market price (
Aboura 2013). Hence,
Merton (
1976) extended the model towards empirically realistic jump diffusion models. Similarly,
Hull and White (
1987) removed the assumption of constant variance by presuming stochastic volatility. Naturally, there are several further extensions of the Black–Scholes model for instance by
Heston (
1993) towards stochastic volatility. Or, similarly by
Cont and Tankov (
2004) and references therein, such as
Chan (
1999) and
Carr et al. (
2003), towards Lévy processes and pricing with jump processes or related approaches, among others the Variance-Gamma model and Normal-Inverse-Gaussian (NIG) model.
Corrado and Su (
1996) enhanced the Black–Scholes model by adding abnormal skewness and kurtosis, which is observed in empirical data. These extensions did render the option pricing formula of Black–Scholes more representative, however, the new complexity still entails conceptual and computational limitations.
Second, there is a growing literature on AI and ML. ML is the study of algorithms and statistical methods designed to solve a particular task using inferences or pattern recognition (
Bishop 2013). A subfield of AI is the application of genetic algorithms or deep neural networks. Both methods are biologically inspired and they are applied in order to process large and complex data (
Van Gerven and Bohte 2017). Given the unpredictable nature of stock market dynamics, the application of AI is advantageous (
Metcalf and Malkiel 1994).
Liu and Wang (
2013) show that the option price can be decomposed in three terms
, where
denotes the option price from the Black–Scholes model,
the price from an autoregressive model, and
the price from a deep neural network;
is a standard error term.
Liu and Wang (
2013) claim that this decomposition leads to more precise pricing than the use of one of the three models.
There is further research capitalizing on AI in option pricing. One of the original attempts with neural networks in option pricing is by
Hutchinson (
1994) and
Chen and Lee (
1997). This research sparked more research on using AI, however due to data and methodological limitations this research was waived in the field of finance until recently (
Yao et al. 2000). Nonetheless, recent discoveries in AI-techniques have given it a new lease of life in finance research (
Andreou et al. 2008;
Schmidt and Lipson 2009). Nevertheless, there are decisive implementation boundaries in finance. The AI-methodology is essentially using trial and error and so the processing power and computational time rise exponentially as complexity increases. This means that complicated problems have to be broken down into smaller less complicated ones, thus reducing the applicability of AI (
James et al. 2017).
3. Methodology, Theory and Data
Genetic programming is a non-deterministic and non-linear methodology that is newly uncovering even symbolic equations from data. The most recent advancement of this technique has been developed to analyse complex laws in physics in 2009. The methodology is mainly inspired by evolution and applicable to any nonlinear dynamical system. We utilize this new type of genetic programming and employ this method on option pricing, particularly fitting non-linear functions between several input data and one output variable (
Schmidt and Lipson 2009).
2The algorithms work as follows: they split the data into training and validation data. Training data is used to fit the parameters, while validation data is utilized in an unbiased way to assess the model. This separation has several advantages while it prevents overfitting (
James et al. 2017). Overfitting can be conducive to a model that is too close to the data, which later limits the generalization of the model (
Prechelt 2012). All details on genetic programming and the respective source code is available online.
3 Previous genetic algorithms did not allow to model each variable separately and finally did not extract the best fitting analytical equations automatically.
Intuitively, the genetic algorithm proceeds in the following steps: First, a random population of solutions is generated. Second this set of solutions is creating new generations of solutions. Third in order to produce a new generation, the genetic algorithm executes several sub-procedures. Each solution is scored according to a numerical value; called a ‘fitness score’ (e.g., the mean absolute error). This is repeatedly done by three steps:
- (i)
Selection: this is essentially the unique solution that will be used as a base for the next generation of solutions (offspring);
- (ii)
Crossover: this is a rule that dictates how the solution will be combined for the next generation of solutions;
- (iii)
Mutation: this is a random modification of the solutions.
The genetic algorithm proceeds all steps over many sequential generations in order to obtain the global optimum, defined by the smallest mean absolute error or root mean square error. The program of our genetic algorithm can be summarized by the following pseudo-code:
START
Generate the initial random population/function (training data)
Compute fitness
REPEAT
Selection
Crossover
Mutation
Compute fitness
UNTIL population/function has converged
STOP
We demonstrate the computational power of this algorithm on option pricing. The automated processes for distilling the data into the form of analytical formulas is promising, particularly in the field of complex derivatives. Unlike econometric models, an automated reverse engineering approach with a GA-methodology is free from assumptions and identifies the real-life empirical relationships.
In finance, option pricing is mainly based on Black–Scholes theory. Suppose we have a call option whose value
depends on the asset price
and time
t. The asset price is modelled according to the geometric Brownian motion:
. We assume that markets are complete and there is no-arbitrage. The theory and evidence from behavioral finance demonstrate that those conditions do not hold in general (
Kahneman and Tversky 1979;
Thaler 1980;
Thaler et al. 1997). Although, we know that these assumptions are too strong in reality, they are necessary in order to solve the Black–Scholes model. Thus, there is a pressing scientific application of our reverse engineering methodology in finance.
Our goal is to find option pricing formulas by employing the method of genetic programming. Consequently, our approach differs significantly to the derivation of Black–Scholes. Black and Scholes(-Merton) use It
’s formula on the value function
together with further assumptions that
is continuously twice differentiable in
S and once in time
t in order to derive the option price formula. The derivation of the Black–Scholes formula is in
Appendix B. We obtain the well-known Black–Scholes equation
Having derived the 2nd-order partial differential equation above, or in short the Black–Scholes Equation (
1), we find the solution for a call- and put-option respectively.
Theorem 1. Black–Scholes Formula for a European call- and put-option is given bywhere denotes the cumulative standard normal probability distribution. There is a nice proof of the Theorem, via a transformation of the Black–Scholes Equation (
1) to a heat equation, available by
Guenther and Juengel (
2003).
The Black–Scholes model is our benchmark for theoretical considerations only. In our paper, we demonstrate how a genetic algorithm identifies a similar analytical function based on a new GA-methodology. We search a call option and a put option function of the form
, where
S denotes the stock price,
K the strike price,
volatility,
time to maturity and
r the risk-free interest rate. We choose the model with the highest R-square and lowest root mean square error given computational efficiency. The GA-methodology quantifies this by the term size—another word for complexity. In our approach, we select the model with a size of approximately 40. Our algorithm computes models up to a size greater than 200. The algorithm stops once a certain criterion such as the number of generations or the time the algorithm is running is reached. We set the limit of 100 h until the algorithm cuts off (stopping criteria). The assessment of the best model follows statistical parameters (
Willmott and Matsuura 2006). The obstacle of a genetic algorithm is that we are able to find meaningful, nontrivial and general analytical relationships for certain invariants.
Our work is based on option data from 25 different companies from the German stock market index DAX (
Table A1). We include both in-money, at-money, and out-of-money options. We download the data from a single day by FactSet (
Bakshi et al. 1997). We follow the procedure that is common in the literature, however, deviate in one respect, due to our AI-methodology, and use raw price data. In the end, we create a big data set including all traded options. The maturity date is almost always within 3 months, i.e., 3 month or less. In total, we have data of 5616 call options and 5174 put options. In addition, we gather the present stock prices, strike prices, implied volatilities and the risk-free interest rate. We choose the 3-months German bond as the risk-free interest rate.
4. Results and Discussion
The results of the GA-methodology reveal several interesting and new findings. First, the exercise gives us a new call- and put-option function in order to price different options based on our German data. Both functions are automatically derived by evolutionary search from the GA-methodology. Note, the output of the new GA-algorithm are both analytical formulas. Hence, we do not merely estimate single coefficients, indeed, we automatically estimate the whole analytical function by the GA-algorithm in order to obtain a functional output as given next. The functions are
The computational quality of our option functions is surprisingly high, given the unconventional functional-shape. The call option function has a R-square of 0.956, a correlation coefficient of 0.979, and mean absolute error of 0.533. Similarly, for the put option, we obtain a R-square of 0.969, a correlation coefficient of 0.985 and the mean absolute error of 0.479. Both formulas do not follow a straight forward intuition such as the Black–Scholes equation. However, this is not surprising given that both formulas are obtained from data with an assumption-free genetic algorithm.
Indeed, our formulas are applicable to real market conditions and work in cases of incomplete markets or under the condition of arbitrage. Additionally, the formulas are computed by options with a maturity of 3-month or less, which makes the economic interpretation rather sophisticated. On the one hand, this enhances the predicative power but surprisingly does not limit the pricing of options with different maturities on the other hand. Furthermore, the algorithm does not explain why these formulas are the best fit, except that they both have the lowest mean absolute error. But this is a known disadvantage of modern AI-techniques as discussed in the literature (
Silver et al. 2018). Finally, one point is striking: the pricing functions under the RE model do not contain any normal probability distribution as under the Black–Scholes model (
2). This is surprising because the GA-methodology is also searching for error-type functions, which are a functional equivalent to the normal probability distribution.
In that regard, there is the need of further research in order to generalize and explain the output of the GA-methodology. A special focus ought to be on RE models with option formulas with different maturities, the property of no-arbitrage and formulas having a similar form to the Black–Scholes model.
In the following, we study the robustness and sensitivity of our formulas. First, we compare the pricing performance with the Black–Scholes model.
Table 1 represents the main results. We check our model with 5615 call options and 5173 put options.
The average market price of calls is of 8.81 Euro. The average Black–Scholes call price is of 8.30 Euro, while the reverse engineering mean price is of 9.00 Euro.
4 The mean variance in our RE model is of 0.57 and lower than the Black–Scholes model (0.77). Counting the cases when the RE-option price has a smaller mean absolute error to the market price demonstrates that the RE model is outperforming the Black–Scholes model in 2740 out of 2791 cases or over 98% of time. The mean absolute error (MAE) is of
between the market price and the RE-option price (
Table 1). Similarly, the root mean square error (RMSE) is of
and it is smallest in the RE model. Furthermore, the null-hypothesis of equality in case of our RE model to the market price cannot be rejected, meaning that the RE model is statistically closely related to the market price of options.
The evaluation of the RE model in regard to put options demonstrate a similar accuracy. For put options the performance of the RE model is robust again. The null-hypothesis of price equality cannot be rejected for the RE model, i.e., our model is significantly better than the Black–Scholes model. Moreover, the MAE of our model is of
and RMSE is of
. Hence, both statistical measures are the lowest when comparing it with the Black–Scholes model. All in all, the statistical findings corroborate the predictive power of the RE model that is based on the new formulas in Equations (
3) and (
4).
To test if the RE model works on data dissimilar to the training data, Amazon option data were used for the same maturity as above.
5 In
Table 2, we summarize the performance of an out-of-sample assessment of our RE model. We use 147 call-options frequently traded in the US market.
We find that in this scenario, the MAE and RMSE is by far greater than above. Moreover, the computation indicates the RMSE of 26.248 is largest for the RE model (
Table 2). The Black–Scholes model has a smaller error despite a mean-price difference of −4.172
$ to the market price. Noteworthy, the option price difference across all models is not significant, despite large error terms in comparison to
Table 1.
This finding is not surprising. As commonly known in the AI-literature, the quality of the model is heavily reliant on the training data. Our training data consist of German options. Likely this sample does not fit option characteristics in other markets similarly well. This limits the application and generalization of the new formulas to foreign option markets.
Next, we study the sensitivity of our RE model. Firstly, we analyze the sensitivity of the option price in our RE model. The sensitivity in this case is based on calculating the change of one standard deviation (SD). So, a sensitivity of 3 means that if you increase the variable by 1 SD, the output varies by 3 SD. Secondly, we compute the correlation between the respective input variable and the option price. A number of 1.0 means that the input and output variable moves to 100 percent in the same direction.
Two issues stand out in
Table 3. First, a change in the risk-free interest rate and maturity have a negligible impact on the option price in our RE model. This is not surprising because in our training data all maturities are within 3 months. Thus, the interest rate is almost always the same—in other words it is a constant. Therefore, the RE model is unable to evaluate a shift in the risk-free interest rate. Second, the other variables denote a significant sensitivity and correlation between input and output. The results are as expected as indicated by our option pricing formula.
Finally, we study in a scenario analysis the Greek Letters in more detail. Moreover, we employ our formulas to an option with a maturity of 14 days in order to study the predictability and universalizability of our formulas, which are trained by maturities within 3 months.
Table 4 represents the results. In the first column, we describe the benchmark case. In the columns to the right-hand side, we study a change of always one variable, while keeping everything else constant (ceteris paribus).
We randomly select a call option with the underlying stock price of 72.1 Euro, strike price of 51.0 Euro, volatility of 0.85, and time to maturity of 14 days. Given these parameters the call option price is of 22.3€ if using the RE model and 21.2 Euro if using the Black–Scholes model. Noteworthy, the market price is of 22.1 Euro. Now, we compute the option prices with both formulas by varying the input variables.
Table 4 uncovers that the option price of the RE model is always greater than the BS-price and in the range of
.
Finally, we analyze the same for the put options. Here, the RE model yields an option price of 31.4 Euro and of 33.1 Euro if using the Black–Scholes model (
Table 5). The actual market price is of 30.1 Euro. The sensitive analysis follows the same procedure as for the call option in
Table 4. In the case of put options, the RE model yields always a lower price than the Black–Scholes model in a range of
. Of course, all Greek Letters are in line with financial theory.
Our reverse engineering approach reveals pros and cons. The major drawback of our approach is its reliance on training data. Secondly, the selection of input variables and the specification of the GA-methodology affects the respective output. In our work, we utilize the same input variables than under the Black–Scholes model. Nonetheless, other input variables may lead to other outcomes. Lastly, the functional output might change if we specify different mathematical operators under the GA-methodology. In our eyes, however, all limitations are excellent topics for further research.