This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Adversarial Deep Hedging: Learning to Hedge
without Price Process Modeling

Masanori HIRANO 0000-0001-5883-8250 The University of TokyoTokyoJapan [email protected] Kentaro MINAMI Preferred Networks, Inc.TokyoJapan [email protected]  and  Kentaro IMAJO Preferred Networks, Inc.TokyoJapan [email protected]
(2023)
Abstract.

Deep hedging is a deep-learning-based framework for derivative hedging in incomplete markets. The advantage of deep hedging lies in its ability to handle various realistic market conditions, such as market frictions, which are challenging to address within the traditional mathematical finance framework. Since deep hedging relies on market simulation, the underlying asset price process model is crucial. However, existing literature on deep hedging often relies on traditional mathematical finance models, e.g., Brownian motion and stochastic volatility models, and discovering effective underlying asset models for deep hedging learning has been a challenge. In this study, we propose a new framework called adversarial deep hedging, inspired by adversarial learning. In this framework, a hedger and a generator, which respectively model the underlying asset process and the underlying asset process, are trained in an adversarial manner. The proposed method enables to learn a robust hedger without explicitly modeling the underlying asset process. Through numerical experiments, we demonstrate that our proposed method achieves competitive performance to models that assume explicit underlying asset processes across various real market data.

deep hedging, price process, adversarial learning, neural network, option, financial market
copyright: acmcopyrightjournalyear: 2023doi: XXXXXXX.XXXXXXXccs: Applied computing Economicsccs: Computing methodologies Neural networks

1. Introduction

Derivative hedging is an important issue in the field of finance. Practical derivative hedging is strongly connected to the theory of mathematical finance, which was pioneered by the work of Black, Scholes and Merton in the 1970s (Black and Scholes, 1973; Merton, 1973). In mathematical finance, the financial market is typically modeled as a complete market, i.e., an ideal market with continuous tradability and no friction. Under this assumption, the optimal hedging strategy is a portfolio that replicates the derivative, which also leads to the theoretical price of the derivative from the no-arbitrage argument. However, the assumption of the complete market does not hold in reality, and perfect hedging is impossible. Therefore, practical hedging strategies are manually adjusted by human traders using various empirical rules. Greeks are the most typical tools for managing risk sensitivities. By managing greeks, traders aim for robust hedging against market changes (see e.g., (Taleb, 1997)).

Deep hedging (Buehler et al., 2019a) was developed to address the problem of hedging in incomplete markets. Deep hedging is a fully computational and data-driven approach based on market simulation and deep hedging techniques that directly optimizes the profit and loss (PL) of the portfolio of derivatives. The advantage of deep hedging is that it can calculate the optimal hedging strategy in terms of a given utility function, while considering various characteristics of real markets, such as market friction, which are difficult to handle within the traditional framework of mathematical finance theory.

The choice of the market simulator, which simulates the price process of the underlying asset, is crucial in deep hedging training. As deep hedging aims to learn the optimal hedging strategy on a given market simulator, the market simulator should cover all the possible scenarios in real markets. Currently, in the literature on deep hedging, there are mainly two approaches to market simulator design:

(i) Models from mathematical finance: While deep hedging can be trained on any market simulator, many existing studies tend to conduct experiments based on underlying asset models developed in mathematical finance. These models include geometric Brownian motion (Black and Scholes, 1973; Merton, 1973), Heston model (Heston, 1993), rough volatility model (Bayer et al., 2015), and jump-diffusion model (Cox and Ross, 1976; Merton, 1976), among others. This approach of utilizing established mathematical finance models is valid as it is both simple to implement and provides a fair comparison with traditional hedging techniques. However, the validity of these models is hindered by their limited ability to simulate market scenarios that could happen in reality. One reason is that the traditional models aim to represent market stylized facts (e.g., volatility surfaces (Gatheral, 2012)) using just a handful of parameters, while they are not necessarily targeting market prediction or path simulations. Additionally, as financial markets are subject to non-stationarity and regime shifts, it is not always possible to make good predictions with a single model. In situations where the assumed underlying asset price process deviates significantly from the actual market conditions, there is a risk of deteriorating hedge performance.

(ii) Machine-learning-based models: An alternative approach is to utilize machine learning methods to learn data-driven market simulators. In recent years, the accelerated development of machine-learning-based generative models has facilitated this approach. Some examples include Generative Adversarial Networks (GAN) training using the actual data in financial markets (Li et al., 2020; Naritomi and Adachi, 2020; Hirano et al., 2022; Wiese et al., 2020), but which requires plenty of computational resources just for generating price series. One of the most pressing challenges for machine-learning-based approaches is that the historical data from financial markets is comparably limited to the amount of data required by contemporary machine learning algorithms. In response to this challenge, various techniques based on market stylized facts or data augmentation have been proposed to mitigate the effects of limited data. For example, Ziyin et al. (Ziyin et al., 2022) proposed a new noise injection method for data augmentation in financial market data. Nonetheless, it remains uncertain whether adjustments based on stylized facts are effective for the downstream task of deep hedging.

In this paper, we propose a novel alternative approach by adopting an adversarial environment to learn the hedging strategy. Our proposed method consists of two adversarial neural networks: a hedger and a generator. The hedger learns to maximize the utility function to optimize the hedging strategy, similar to the existing deep hedging framework. On the other hand, the generator, which is newly introduced in our framework, is a generative neural network that simulates the underlying asset. The generator learns to simulate the market to make it more difficult for the hedger to maximize the utility function. The proposed method can be considered as a framework similar to adversarial learning. It is expected to promote robust learning against environmental changes by a generator providing an environment that is unfavorable to the hedger. This is a desirable property, considering that real markets are non-stationary and difficult to predict, and regime shifts exist. Moreover, the modeling aspect of our approach has a distinct advantage in that it can learn the hedging strategy without presuming an explicit underlying asset model. Although our proposed approach is among the earliest attempts at adversarial hedging, we demonstrate through numerical experiments in Section 6 that the adversarially learned hedger performs well in real markets.

2. Related Work

In their seminal work (Buehler et al., 2019a, b), Buehler et al. proposed a method called Deep Hedging. Deep hedging utilizes neural networks to model hedging strategies and construct optimal strategies by directly maximizing utility functions derived from the final Profit & Loss (PL). Deep hedging has been recognized as a breakthrough in the derivative industry, owing to two prominent features: First, deep hedging can handle various types of frictions by a fully computational approach. Second, deep hedging bypasses the need for theoretical pricing models, which are prerequisites for other standard hedging methods, such as those based on Greeks. Since the introduction of deep hedging, many efforts have been devoted to expand its versatility. Imaki et al. (Imaki et al., 2023) proposed a deep hedging model that incorporates no-transaction band (Davis et al., 1993) into the neural network architecture, resulting in fast convergence of learning. Murray et al. (Murray et al., 2022; Buehler et al., 2022) proposed an actor-critic-based reinforcement learning for deep hedging and achieved almost equivalent performance to the original deep hedging. Hirano et al. (Hir, 2023) extended the deep hedging framework into a nested structure, thereby facilitating the use of options as hedging instruments. The authors also proposed efficient simulation designs and a learning algorithm to circumvent the computational issues.

Several recent studies focus on the data used for learning of deep hedging. Mikkila et al. (Mikkilä and Kanniainen, 2023) argued that deep hedging often depends on a specific choice of price process simulator, which could result in suboptimal performance. They suggested that improved performance could be achieved by utilizing empirical data for training. However, the amount of available historical market data is often limited. Horvath et al. (Horvath et al., 2021b) proposed a deep hedging model based on rough volatility models such as the rBergomi model (Bayer et al., 2015), which can model (non-Markov) jumps in price processes.

Other studies have also focused on generating financial time series using deep-learning-based models. For example, several researchers have proposed variants of Generative Adversarial Networks (GANs) for generating financial time series (Li et al., 2020; Naritomi and Adachi, 2020; Hirano et al., 2022; Wiese et al., 2020). Hayashi et al. (Hayashi and Nakagawa, 2022) proposed a generative diffusion model tailored for financial markets. While these were originally intended for purposes other than deep hedging, they can be adapted for use within the deep hedging framework. However, to the best of our knowledge, there has not been ample exploration of deep generative models explicitly designed with the direct goal of enhancing deep hedging performance. This specific research gap is what we aim to address in this paper.

3. Setting: Discrete Time Market with Frictions

Throughout this paper, we consider the problem of hedging an option with its underlying asset. We consider a discrete-time financial market with a finite time horizon TT and trading dates 0=t0<t1<<tn=T0=t_{0}<t_{1}<\cdots<t_{n}=T. At t=t0t=t_{0}, the hedger (the issuer of the option) sells one unit of the option. The hedger aims to hedge the risk arising from the future payoff of the option by trading the underlying asset SS. SS is assumed to be always tradable, and its price at time tt is denoted as StS_{t}. At each trading date tit_{i}, the hedger sets a new position δti\delta_{t_{i}} in SS. For all transactions of SS, a proportional transaction cost is charged at a rate of cc per unit price.

Option ZZ is a contract in which the payoff at time t=Tt=T depends on the price of the underlying asset SS. Examples include an European option Z(S)=max(STK,0)Z(S)=\max(S_{T}-K,0) and a Lookback option Z(S)=max(max(S)K,0)Z(S)=\max(\max(S)-K,0), where KK denotes the strike value of the options. These options will also be used in the experiment in Section 6.

The Profit & Loss (PL) of the hedger (the issuer) is formulated as follows:

(1) PLT(Z,S,δ)\displaystyle\mathrm{PL}_{T}(Z,S,\delta) :=\displaystyle:= Z(S)+(δS)TCT(δ)\displaystyle-Z(S)+(\delta\cdot S)_{T}-C_{T}(\delta)
(2) (δS)T\displaystyle(\delta\cdot S)_{T} :=\displaystyle:= i=0n1δti(Sti+1Sti)\displaystyle\sum_{i=0}^{n-1}\delta_{t_{i}}(S_{t_{i+1}}-S_{t_{i}})
(3) CT(δ)\displaystyle C_{T}(\delta) :=\displaystyle:= i=0ncSti|δtiδti1|\displaystyle\sum_{i=0}^{n}cS_{t_{i}}|\delta_{t_{i}}-\delta_{t_{i-1}}|

where δ1=δtn=0\delta_{-1}=\delta_{t_{n}}=0. Here, (δS)T(\delta\cdot S)_{T} is the total return resulting from the trading of the underlying asset, and CT(δ)C_{T}(\delta) is the total transaction costs.

The objective function of the hedger is defined by the PL and the utility function uu. Specifically, the loss function to be minimized is defined as follows:

(4) l(δ)=u(PLT(Z,S,δ)).\displaystyle l(\delta)=-u\left(\mathrm{PL}_{T}(Z,S,\delta)\right).

For an example of the utility function uu, Entropic Risk Measure (ERM) is defined as

(5) u(x)=1λlog𝔼[exp(λx)]\displaystyle u(x)=-\frac{1}{\lambda}\log\mathbbm{E}\left[\exp{(-\lambda x)}\right]

where λ\lambda is the risk preference coefficient. Expected Shortfall (Conditional Value at Risk; CVaR) is defined as

(6) u(x)=11αVaR(α)xp(x)𝑑x\displaystyle u(x)=\frac{1}{1-\alpha}\int_{-\infty}^{\mathrm{VaR}(\alpha)}x\cdot p(x)dx

where α\alpha is the confidence level and satisfies 0α10\leq\alpha\leq 1.

4. Method: Adversarial Deep Hedging

Our goal is to learn deep-learning-based hedging strategies that perform well in real-world markets. As we mentioned in the introduction, an efficient design of the market simulator is crucial to improve the performance of deep hedging. While the existing studies of deep hedging often employ underlying asset price models from the mathematical finance literature, we here study more flexible deep-learning-based models to pursue better training of hedging strategies.

The central idea of our approach is to employ the concept of adversarial learning. In the deep learning literature, it is well known that there are “difficult” input data called adversarial examples that significantly degrade the performance on the machine learning tasks such as image classification (Goodfellow et al., 2014b; Madry et al., 2017). Adversarial examples can be obtained by adding noises to existing images in training dataset. The noises are optimized toward the worst-case directions that deteriorates the classicication performance most (hence the name of “adversarial” examples). Interestingly, it is shown that adding adversarial noises during training improves the overall classification performance (Goodfellow et al., 2014b). This idea would be useful for improving the market model for deep hedging training. As real market data can contain many types of price movements that are difficult to be modeled (e.g., jumps and regime shifts), we expect that adversarial learning can make the deep hedging model robust against unseen environmental changes that are never generated from a simple market simulator.

To formulate the idea of adversarial learning of deep hedging, we propose a framework based on the mim-max game paradigm, akin to Generative Adversarial Networks (GANs) (Goodfellow et al., 2014a). This approach offers several potential advantages. Firstly, it is anticipated that the hedger is robustly trained against perturbations in the market environment. Secondly, we can circumvent the need for explicit modeling of the asset model.

Figure 1 shows the outline of the adversarial deep hedging. Similar to the original deep hedging, the hedger receives the underlying asset price StS_{t} and relevant information as inputs, and determines the optimal hedging position. We introduce a new component, the generator, that handles market simulation.

Refer to caption
Figure 1. Inputs/outputs of adversarial deep hedging. htih_{t_{i}} is a hidden state of the generator, RtiR_{t_{i}} is a random variable for generation, StiS_{t_{i}} is underlying asset price, ItiI_{t_{i}} is available information for the hedger, and δti\delta_{t_{i}} is the hedge position.

In what follows, we will elaborate on each component of our proposed framework.

4.1. Hedger

Hedger HH is a neural network that generates a new hedge position δti\delta_{t_{i}} using the relevant information at time tit_{i}:

(7) δti=H(Sti,Iti,δti1),\displaystyle\delta_{t_{i}}=H(S_{t_{i}},I_{t_{i}},\delta_{t_{i-1}}),

where StiS_{t_{i}} is underlying asset price, ItiI_{t_{i}} is other relevant information at time tit_{i}, and δti1\delta_{t_{i-1}} is the previous hedge position. ItiI_{t_{i}} can contain information related to theoretical optimal hedging, such as Black–Scholes delta, as well as any information of market conditions. Since the theoretical optimal hedging depends on the previous position in the presence of transaction costs (see e.g., (Imaki et al., 2023)), it is natural for the hedger to take δti1\delta_{t_{i-1}} as an input.

4.2. Generator

Generator GG is a neural network generating an underlying asset price sequence. As the generator should generate causal time series, it is sensible to employ Recurrent Neural Network (RNN)-type architecture, as described below. The generator has hidden state vector hth_{t}. At each time step tit_{i}, the generator receives the previous hidden state hti1h_{t_{i-1}}, asset price Sti1S_{t_{i-1}}, and a random variable RtiR_{t_{i}}, and outputs a new asset price StiS_{t_{i}} and hidden state htih_{t_{i}}:

(8) (Sti,hti)=G(hti1,Sti1,Rti).\displaystyle(S_{t_{i}},h_{t_{i}})=G(h_{t_{i-1}},S_{t_{i-1}},R_{t_{i}}).

Here, similar to the generator in a standard GAN, RtiR_{t_{i}} plays a role in injecting exogeous randomness for generation.

4.3. Adversarial Learning

In the spirit of GAN, the adversarial deep hedging is formulated as a min-max game. More formally, the hedger and the generator are trained through the following optimization problem: 111 Here, to enhance the intuitive understanding of functional dependence, we omitted the time index tt and used simplified notations. The generator in Eq. (8) and the hedger in Eq. (7) are abbreviated as G(R)G(R) and H(G(R),I)H(G(R),I), respectively.

(9) minGmaxHu(PLT(Z,G(R),H(G(R),I))).\displaystyle\min_{G}\max_{H}u\left(\mathrm{PL}_{T}(Z,G(R),H(G(R),I))\right).

The generator and the hedger are trained in an alternating and adversarial manner. Specifically, the hedger strives to maximize the utility function of the terminal wealth, while the generator aims to adversarially learn the distribution of unfavorable paths for the hedger.

5. Numerical Stability Analysis

In the previous section, we have introduced the concept of adversarial deep hedging at an abstract level. However, it is not clear whether the min-max problem in Eq. (9) is well-posed. In other words, it is not evident whether there exists an optimal solution or a local equilibrium, nor is the stability of learning guaranteed in practical settings. In fact, the well-posedness depends on the specific problem formulation, including the choice of the generator class, the hedger class, the option payoff, and the utility function. For example, when the expressive power of the generator class is too high, it may allow for the generation of unrealistic and extreme paths, which could destabilize hedger learning. Therefore, it is presumed that the learning stability requires some form of regularity assumptions to ensure learning stability. Moreover, it is known that min-max problems like GANs often suffer from learning instability, which requires careful design of the learning algorithm.

To gain an intuitive understanding of learning stability, we here examine a toy problem described as follows. We consider a market model with only one underlying asset StS_{t} and two time instants t{0,1}t\in\{0,1\} (i.e., n=1n=1 in Section 3). We assume that S0S_{0} is a given constant. Thus, the generator GG is responsible for generating a single price S1S_{1}\in\mathbb{R}, and the hedger HH determines a scalar-valued position δ\delta\in\mathbb{R}. The payoff function of the option is given as Z(S1)=max{S1K,0}Z(S_{1})=\max\{S_{1}-K,0\}, where the strike value KK is assumed to be same as the initial price S0S_{0}. Then, the PL at the terminal time is written as:

(10) PLT(Z,S1,δ)=Z(S1)+δ(S1S0)c|δ|S0.\displaystyle\mathrm{PL}_{T}(Z,S_{1},\delta)=-Z(S_{1})+\delta(S_{1}-S_{0})-c|\delta|S_{0}.

For simplicity, we assume that the distribution of S1S_{1} is a Gaussian distribution S1S0𝒩(μ,σ),S_{1}-S_{0}\sim\mathcal{N}(\mu,\sigma), where the generator determines μ\mu and/or σ\sigma.

For the utility function, we will use ERM(10.0) and CVaR(0.95). Here, ERM(10.0) means the ERM-based utility function with λ=10.0\lambda=10.0 in Eq. (5), and CVaR(0.95) means the CVaR-based utility function with α=0.95\alpha=0.95 in Eq. (6).

5.1. Case 1: Fixed Generator

Firstly, we fixed the generator parameters (μ,σ)(\mu,\sigma) and checked the response of δ\delta (the hedger) to the utility. We set μ=0.0,σ=0.2\mu=0.0,\sigma=0.2, and the goal is to maximize the utility function with respect to δ\delta.

Refer to caption
Refer to caption
Figure 2. Results (left: ERM(10.0), right: CVaR(0.95)) of Utility vs. δ\mathbf{\delta} under the Generator is fixed. Peaks exist at δ=0.5011\mathbf{\delta=0.5011} for EMR(10.0) and δ=0.5082\mathbf{\delta=0.5082} for CVaR(0.95).

We plot the utility values in Figure 2. It is evident that each utility function is concave in δ\delta, and the optimization problem has a unique optimal solution. In each case, the utility function exhibits a peak around δ=0.5\delta=0.5. This means that the optimal solution is nearly identical to the Black–Scholes’ delta hedging. However, owing to the cost (i.e., the last term in Eq. (10)), the utility peak is slightly different from δ=0.5\delta=0.5.

5.2. Case 2: Adversarially Optimized Mean

Secondly, we tested the case where the generator can adversarially optimize the mean parameter μ\mu.

Figure 3 and 4 show the utility surfaces and their gradients plotted against δ\delta and μ\mu, respectively for ERM and CVaR. We also run adversarial learning simulations and plotted their trajectories in the right panels. For the configuration of the learning algorithm (e.g., the learning rates and the two time-scale update rule), we used the same settings as the experiments in Section 6.

Refer to caption
Refer to caption
Figure 3. Results of utility among different δ\delta and μ\mu (ERM(10.0)). The left figure shows the utility surface and the right figure shows the utility heatmap and gradient arrow graph, and the blue line is the result of adversarial training simulation.
Refer to caption
Refer to caption
Figure 4. Results of utility among different δ\delta and μ\mu (CVaR(0.95)). The left figure shows the utility surface and the right figure shows the utility heatmap and gradient arrow graph, and the blue line is the result of adversarial training simulation.

According to Figures 3 and 4, the min-max game formulated in Eq. (9) can be convergent into the point around δ=0.5,μ=0.0\delta=0.5,\mu=0.0. This suggests that, when the generator optimizes only the mean μ\mu in an adversarial manner, the dynamical system determined by the learning algorithm can converge to some equilibrium. Furthermore, this result also suggests that the most unfavorable market environment for the hedger entails a zero expected return of the underlying asset, which is intuitively understandable as the no-arbitrage condition.

5.3. Case 3: Adversarially Optimized Volatility

Thirdly, we fixed μ=0\mu=0 and let the generator optimize the volatility parameter σ\sigma. Figure 5 shows utility surfaces plotted against δ\delta and σ\sigma.

Refer to caption
Refer to caption
Figure 5. Utility surfaces among different δ\delta and σ\sigma (left: ERM(10.0), right: CVaR(0.95)).

In either case, the utility value increases as σ\sigma becomes larger, indicating that the Nash equilibrium of the min-max game does not exist. As such, it is anticipated that the volatility can become arbitrarily large through the adversarial learning. This is an intuitive result, since a more volatile market environment is more unfavorable for the hedger. This example suggests that using a generator class with excessively high expressive power can lead to instability in adversarial learning.

Note that, for each fixed value of σ\sigma, δ\delta always has a local minimum around 0.50.5. This suggests the hedger may converge to an optimal solution, even when the generator fails to converge. One reason for this is that, in this particular example, the optimal hedging action remains unchanged regardless of the magnitude of the volatility. In the experiment in Section 6, we confirm that such “scale invariance” holds even in more realistic examples of European and lookback options. In general settings, however, it is considered that the scale invariance does not hold, and it would be more reasonable to introduce some constraints on the volatility. See a related discussion in Section 8.2 as well.

6. Experiment

We conducted an experiment to demonstrate the effectiveness of our methods on real market data. We used ten different experimental settings consisting of two options and five utility functions as follows:

  • Option ZZ: We used (i) European Call Option and (ii) Lookback Call Option explained in Section 3. For both types of options, the strike KK is set as K(=St0)=1.0K(=S_{t_{0}})=1.0.

  • Utility function uu: We used (a) Entropic Risk Measure (ERM) with three different risk preference coefficients λ=1.0\lambda=1.0, 10.010.0, 100.0100.0, and (b) Conditional Value-at-Risk (CVaR) with two different confidence levels α=0.9\alpha=0.9, 0.950.95.

We compared the following models:

  • Proposed: Adversarial deep hedging.

  • Brownian: Deep hedging using the geometric Brownian motion as an underlying asset price process. The annual volatility parameter σ\sigma is set to 0.20.2.

  • Heston: Deep hedging using the Heston model (Heston, 1993) as an underlying asset price process. For the parameters of the Heston model, we followed the same setting as in (Buehler et al., 2019b; Hir, 2023) (i.e., κ=1.0\kappa=1.0, θ=0.04\theta=0.04, ρ=0.7\rho=-0.7, and σ=0.3\sigma=0.3).

Additionally, we used the following parameters across all tasks: the exercise price of the option was set to 1.0, the option maturity was 20 days, the transaction cost ratio was c=104c=10^{-4}, the learning rates for the hedger and the generator were 10310^{-3}, the two time-scale update rule (Heusel et al., 2017) was set to G:H=1:5, the number of epochs was 5,000 for European option and 1,000 for Lookback option (due to computational resource constraints), 50,000 price series were used per epoch during training, and 10,000 price series were used per epoch during evaluation. To stabilize the evaluation, we take the mean of 20 times trials only for the evaluation.

The adversarial learning interaction between the generator and the hedger can exhibit instability, which is a characteristic shared with GANs. To address this, we adopted the performance indicator to take our model’s best snapshot. This is somewhat analogous to the use of the Inception score (Salimans et al., 2016) or the Fréchet Inception Distance (FID) (Heusel et al., 2017) in the GAN literature. For our indicator, we employed the performance of the hedger of adversarial deep hedging when the underlying asset price process was Brownian. However, we stress that it does not imply that the underlying asset price process was used during training.

We tested the best snapshot models of the hedger on real market data. We used daily prices of the following three stock indices: 222Note that for simplicity, we used the Close-Close test, which differs from actual trading.

  • S&P 500: S&P 500 (U.S.) data between January 2000 and August 2022

  • S&P 500 (old): S&P 500 (U.S.) data between January 1931 and December 1950

  • BVSP: Bovespa Index (Brazil) data between January 2000 and August 2022

We chose these data because they exhibit significantly different characteristics, such as market efficiency. In general, emerging markets are considered to be more inefficient and exhibit characteristics such as long-term correlation (Beben and Orłowski, 2001).

We divided the evaluation data into time windows of T=20T=20 days each and tested the performance of the hedgers on each of these windows. To align with the training conditions, we normalized the data such that the initial price St0S_{t_{0}} of each time window was set to 1.0. For each experimental setting, we reported the average and the standard deviation of performance across the windows.

7. Results

Table 1. Results of hedge prices (costs) for each setting. Underlined results are the best results among the proposed Brownian and Heston models. Bold results are better results than the Black–Scholes price.

S&P 500
Option ZZ Utility uu Proposed Brownian Heston Black–Scholes European ERM(1.0) 0.019669±0.0003950.019669\pm 0.000395 0.018615±0.000228¯\underline{\mathbf{0.018615\pm 0.000228}} 0.018720±0.000186\mathbf{0.018720\pm 0.000186} 0.0191430.019143 European ERM(10.0) 0.020818±0.0001620.020818\pm 0.000162 0.020619±0.000100\mathbf{0.020619\pm 0.000100} 0.020578±0.000080¯\underline{\mathbf{0.020578\pm 0.000080}} 0.0207500.020750 European ERM(100.0) 0.118480±0.002498\mathbf{0.118480\pm 0.002498} 0.118334±0.001245¯\underline{\mathbf{0.118334\pm 0.001245}} 0.120333±0.000959\mathbf{0.120333\pm 0.000959} 0.1232650.123265 European CVaR(0.9) 0.055750±0.001051\mathbf{0.055750\pm 0.001051} 0.057322±0.0008770.057322\pm 0.000877 0.052462±0.000888¯\underline{\mathbf{0.052462\pm 0.000888}} 0.0566780.056678 European CVaR(0.95) 0.068432±0.000855\mathbf{0.068432\pm 0.000855} 0.069850±0.0007430.069850\pm 0.000743 0.063135±0.000953¯\underline{\mathbf{0.063135\pm 0.000953}} 0.0697780.069778 Lookback ERM(1.0) 0.031467±0.001257\mathbf{0.031467\pm 0.001257} 0.030218±0.000607\mathbf{0.030218\pm 0.000607} 0.029981±0.000254¯\underline{\mathbf{0.029981\pm 0.000254}} 0.0316530.031653 Lookback ERM(10.0) 0.035418±0.001309\mathbf{0.035418\pm 0.001309} 0.034319±0.000264\mathbf{0.034319\pm 0.000264} 0.034189±0.000250¯\underline{\mathbf{0.034189\pm 0.000250}} 0.0356090.035609 Lookback ERM(100.0) 0.189564±0.0093560.189564\pm 0.009356 0.169649±0.006907¯\underline{\mathbf{0.169649\pm 0.006907}} 0.171893±0.003831\mathbf{0.171893\pm 0.003831} 0.1807210.180721 Lookback CVaR(0.9) 0.084800±0.001601\mathbf{0.084800\pm 0.001601} 0.082999±0.001293¯\underline{\mathbf{0.082999\pm 0.001293}} 0.085991±0.002103\mathbf{0.085991\pm 0.002103} 0.0886650.088665 Lookback CVaR(0.95) 0.107428±0.003131\mathbf{0.107428\pm 0.003131} 0.106571±0.001689\mathbf{0.106571\pm 0.001689} 0.102949±0.001497¯\underline{\mathbf{0.102949\pm 0.001497}} 0.1112280.111228
S&P 500 (old)
Option ZZ Utility uu Proposed Brownian Heston Black–Scholes European ERM(1.0) 0.024419±0.000213¯\underline{0.024419\pm 0.000213} 0.024681±0.0000870.024681\pm 0.000087 0.024816±0.0000650.024816\pm 0.000065 0.0239990.023999 European ERM(10.0) 0.027126±0.0001510.027126\pm 0.000151 0.027073±0.000085¯\underline{0.027073\pm 0.000085} 0.027075±0.0000640.027075\pm 0.000064 0.0270340.027034 European ERM(100.0) 0.106246±0.002327¯\underline{\mathbf{0.106246\pm 0.002327}} 0.109020±0.001406\mathbf{0.109020\pm 0.001406} 0.110758±0.000523\mathbf{0.110758\pm 0.000523} 0.1115960.111596 European CVaR(0.9) 0.078522±0.001454\mathbf{0.078522\pm 0.001454} 0.080840±0.0011210.080840\pm 0.001121 0.074912±0.001011¯\underline{\mathbf{0.074912\pm 0.001011}} 0.0799360.079936 European CVaR(0.95) 0.096169±0.001681\mathbf{0.096169\pm 0.001681} 0.098889±0.0010400.098889\pm 0.001040 0.090915±0.001360¯\underline{\mathbf{0.090915\pm 0.001360}} 0.0980170.098017 Lookback ERM(1.0) 0.042866±0.0007150.042866\pm 0.000715 0.042537±0.000191¯\underline{0.042537\pm 0.000191} 0.042679±0.0001700.042679\pm 0.000170 0.0421580.042158 Lookback ERM(10.0) 0.056832±0.003741¯\underline{0.056832\pm 0.003741} 0.058438±0.0012290.058438\pm 0.001229 0.059716±0.0011320.059716\pm 0.001132 0.0545460.054546 Lookback ERM(100.0) 0.293896±0.010271¯\underline{0.293896\pm 0.010271} 0.300853±0.0269350.300853\pm 0.026935 0.300347±0.0079460.300347\pm 0.007946 0.2722720.272272 Lookback CVaR(0.9) 0.145088±0.0023630.145088\pm 0.002363 0.142618±0.0015930.142618\pm 0.001593 0.141590±0.004286¯\underline{\mathbf{0.141590\pm 0.004286}} 0.1417130.141713 Lookback CVaR(0.95) 0.179468±0.005448¯\underline{0.179468\pm 0.005448} 0.188930±0.0042090.188930\pm 0.004209 0.184107±0.0026580.184107\pm 0.002658 0.1773790.177379
BVSP
Option ZZ Utility uu Proposed Brownian Heston Black–Scholes European ERM(1.0) 0.029468±0.0006000.029468\pm 0.000600 0.028637±0.000352¯\underline{0.028637\pm 0.000352} 0.028963±0.0002800.028963\pm 0.000280 0.0284760.028476 European ERM(10.0) 0.031955±0.0002500.031955\pm 0.000250 0.031765±0.000174\mathbf{0.031765\pm 0.000174} 0.031721±0.000130¯\underline{\mathbf{0.031721\pm 0.000130}} 0.0318090.031809 European ERM(100.0) 0.191471±0.003796¯\underline{\mathbf{0.191471\pm 0.003796}} 0.196748±0.001885\mathbf{0.196748\pm 0.001885} 0.198085±0.000672\mathbf{0.198085\pm 0.000672} 0.2002920.200292 European CVaR(0.9) 0.077644±0.002068\mathbf{0.077644\pm 0.002068} 0.079088±0.0013710.079088\pm 0.001371 0.071958±0.001465¯\underline{\mathbf{0.071958\pm 0.001465}} 0.0786190.078619 European CVaR(0.95) 0.091748±0.001123\mathbf{0.091748\pm 0.001123} 0.093617±0.001179\mathbf{0.093617\pm 0.001179} 0.084048±0.001356¯\underline{\mathbf{0.084048\pm 0.001356}} 0.0938650.093865 Lookback ERM(1.0) 0.049972±0.0014630.049972\pm 0.001463 0.049670±0.000667¯\underline{0.049670\pm 0.000667} 0.049796±0.0003020.049796\pm 0.000302 0.0487940.048794 Lookback ERM(10.0) 0.056038±0.0019580.056038\pm 0.001958 0.055078±0.000453¯\underline{0.055078\pm 0.000453} 0.055470±0.0004680.055470\pm 0.000468 0.0548070.054807 Lookback ERM(100.0) 0.227208±0.0130920.227208\pm 0.013092 0.195300±0.008136\mathbf{0.195300\pm 0.008136} 0.194505±0.004359¯\underline{\mathbf{0.194505\pm 0.004359}} 0.2226510.222651 Lookback CVaR(0.9) 0.120657±0.0025150.120657\pm 0.002515 0.117172±0.001533¯\underline{\mathbf{0.117172\pm 0.001533}} 0.118355±0.003760\mathbf{0.118355\pm 0.003760} 0.1186960.118696 Lookback CVaR(0.95) 0.138230±0.004309\mathbf{0.138230\pm 0.004309} 0.142132±0.0030110.142132\pm 0.003011 0.137341±0.001893¯\underline{\mathbf{0.137341\pm 0.001893}} 0.1395020.139502

Table 1 shows the hedging test results on the actual data. Each row corresponds to a different hedging criterion. The values in the table represent the hedging cost l(δ)l(\delta), where lower values indicate superior hedging performance. Underlined numbers correspond to the best results among three models compared, i.e., Proposed, Brownian, and Heston detailed in section 6. Bold numbers mean that the corresponding models outperform the Black–Scholes price.

According to the table, no single model is always better than others For example, in the results on S&P 500 data, the Heston model tends to outperform other models. However, in the results on S&P500 old data, our proposed model tends to outperform other models.

While our proposed model does not consistently outperform the other baseline models, the differences between our model and others are relatively minor, typically less than 2%.

Refer to caption
(a) ERM(1.0) & European Option
Refer to caption
(b) CVaR(0.90) & European Option
Refer to caption
(c) ERM(1.0) & Lookback Option
Refer to caption
(d) CVaR(0.90) & Lookback Option
Figure 6. Histograms of PL for Brownian (blue) and the proposed (orange) method. The utility function and option type differ in each figure. Backtesting data is S&P500.

Figure 66 show the distribution of the PL of hedging results on the S&P 500 data backtest. The Brownian model and our proposed model are represented by the blue and orange histograms, respectively. According to these results, we can observe almost all of the PL distributions achieved by the Brownian model are replicated by our proposed adversarial deep hedging. This replication is especially noticeable when the CVaR is used as the utility function (Figure 6 and Figure 6). Interestingly, it is apparent that when the utility function is ERM, the proposed model generates positive PL with a positive probability. This suggests that the adversarial learning might be encouraging the hedger to explore a more diverse range of opportunities to attain profits.

8. Discussion

8.1. Performance of Adversarial Deep Hedging

According to the experimental results, the proposed approach does not consistently outperform the baselines. However, it does achieve promising performance. Regarding the S&P500 data, the Heston model tends to outperform other models. In contrast, for the S&P500 old data, the proposed approach shows a higher likelihood of outperforming other models. Nonetheless, what we want to emphasize is that the proposed model achieves comparable performance to other models, regardless of the evaluation data or the utility function. This result is noteworthy because the proposed method does not rely on explicit modeling of underlying asset price process.

In general, the optimal choice of the underlying asset model is not trivial and depends on the utility function and the market data used for testing. In the experimental results, when the utility function is ERM, the Brownian model tends to perform relatively better than the Heston model. On the other hand, when the utility function is CVaR, which focuses more on tail risk, the Heston model tends to achieve higher performance. Moreover, there are calibration issues with the underlying asset models. Traditionally, parameters for mathematical finance models are estimated to fit the historical market data or the implied volatility. We should also note that, with more complex models such as rough volatility models, the calibration itself can be unstable or computationally challenging (see e.g., (Horvath et al., 2021a)). However, the training of deep hedging requires the generation of future scenarios through simulations, and the standard calibration methods may not necessarily align with this purpose. As the Brownian model and the Heston model have only a few parameters, they might not be well-suited for simulating future paths in highly non-stationary real-world markets. This is also suggested by the high performance of the proposed method in S&P500old and BVSP, which are considered as more non-stationary markets. One possible reason for this is that the adversarial learning can train the hedger efficiently while avoiding overfitting to historical data. Considering these points, the proposed method has the potential to be more generally useful across broader markets and utility functions.

8.2. Generator Volatility

Refer to caption
Figure 7. Generated price path example.

Figure 7 shows an example of paths generated by the generator learned through adversarial learning. The distribution of paths appears roughly symmetric in the logarithmic domain and qualitatively resembles a discretized geometric Brownian motion. However, the generated paths exhibit significantly large volatilities. This can be attributed to the fact that, as discussed in Section 5, the utility function can monotonically decrease with an increase in the generator’s volatility, leading to the exceedingly high volatility of the adversarially learned generator. Nevertheless, in our experiments, the hedger seems to have been effectively trained. One possible explanation is that hedging European options and lookback options possess a certain scale invariance, where volatility has a relatively minor impact on the optimal hedging actions. In particular, when the strike KK and initial value S0S_{0} are the same, the payoff of a European option max{STS0,0}\max\{S_{T}-S_{0},0\} is positive homogeneous. Indeed, if the generator volatility is multiplied by a constant factor α\alpha (thus the random variable STS0S_{T}-S_{0} as well), the probability of the payoff occurring remains unchanged, and the value of the payoff simply becomes α\alpha times the original value. As a result, the optimal hedging action remains invariant under such scaling of volatility. However, when dealing with financial derivatives whose optimal hedging actions depend on the path’s scale, such as volatility swaps or barrier options, it may be necessary to impose certain volatility constraints during training. Developing effective volatility constraints (or regularizations) is left for future work. Additionally, in practical derivative businesses, underlying asset models are commonly calibrated to observed volatility surfaces in the market. Developing techniques for adversarial deep hedging to calibrate the generator to real volatility surfaces would also be an interesting future work.

9. Conclusion

In this study, we proposed a novel approach named adversarial deep hedging, aimed at efficient training of deep hedging strategies without reliance on an assumed underlying price process. The key idea is to incorporate the concept of adversarial learning. We introduce a new component, the generator, that is responsible for generating the price process, and the hedger and the generator engage in adversarial learning through a min-max game. The key advantage of employing adversarial deep hedging lies in its ability to obviate the need for explicit modeling of underlying price processes, thereby circumventing any learning biases that may arise from modeling assumptions. In the experiments, we empirically demonstrated that the proposed method exhibits competitive hedging performance even in the absence of an explicit price process model.

There are a number of future research directions suggested by this study. The adversarial deep hedging tends to diverge the generator volatility. Therefore, it is essential to explore appropriate constraints or regularization on volatility without compromising the hedge performance. Additionally, as adversarial deep hedging currently incurs significant computational costs, investigating more efficient learning algorithms is also a crucial task.

References

  • (1)
  • Hir (2023) 2023. Efficient Learning of Nested Deep Hedging using Multiple Options. In 14th IIAI International Congress on Advanced Applied Informatics. 514–521. https://doi.org/10.1109/IIAI-AAI59060.2023.00104
  • Bayer et al. (2015) Christian Bayer, Peter Friz, and Jim Gatheral. 2015. Pricing under rough volatility. Quantitative Finance 16, 6 (2015), 887–904. https://doi.org/10.1080/14697688.2015.1099717
  • Beben and Orłowski (2001) M. Beben and A. Orłowski. 2001. Correlations in financial time series: established versus emerging markets. The European Physical Journal B - Condensed Matter and Complex Systems 20 (2001), 527–530. https://doi.org/10.1007/s100510170233
  • Black and Scholes (1973) Fischer Black and Myron Scholes. 1973. The Pricing of Options and Corporate Liabilities. The Journal of Political Economy 81, 3 (1973), 637–654. https://doi.org/10.1086/260062
  • Buehler et al. (2019a) Hans Buehler, Lukas Gonon, Josef Teichmann, and Ben Wood. 2019a. Deep hedging. Quantitative Finance 19, 8 (2019), 1271–1291. https://doi.org/10.1080/14697688.2019.1571683
  • Buehler et al. (2019b) Hans Buehler, Lukas Gonon, Josef Teichmann, Ben Wood, Baranidharan Mohan, and Jonathan Kochems. 2019b. Deep Hedging: Hedging Derivatives Under Generic Market Frictions Using Reinforcement Learning. (2019). https://doi.org/10.2139/ssrn.3355706
  • Buehler et al. (2022) Hans Buehler, Murray Phillip, and Ben Wood. 2022. Deep Bellman Hedging. (2022). https://doi.org/10.2139/SSRN.4151026
  • Cox and Ross (1976) John C. Cox and Stephen A. Ross. 1976. The valuation of options for alternative stochastic processes. Journal of Financial Economics 3, 1-2 (1976), 145–166. https://doi.org/10.1016/0304-405X(76)90023-4
  • Davis et al. (1993) Mark H. A. Davis, Vassilios G. Panas, and Thaleia Zariphopoulou. 1993. European Option Pricing with Transaction Costs. SIAM Journal on Control and Optimization 31, 2 (1993), 470–493. https://doi.org/10.1137/0331022
  • Gatheral (2012) Jim Gatheral. 2012. The Volatility Surface: A Practitioner’s Guide. John Wiley & Sons.
  • Goodfellow et al. (2014a) Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014a. Generative Adversarial Nets. Advances in Neural Information Processing Systems (2014), 2672–2680. https://doi.org/10.1145/3422622
  • Goodfellow et al. (2014b) Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. 2014b. Explaining and Harnessing Adversarial Examples. (2014). https://doi.org/10.48550/arXiv.1412.6572
  • Hayashi and Nakagawa (2022) Kohei Hayashi and Kei Nakagawa. 2022. Fractional SDE-Net: Generation of Time Series Data with Long-term Memory. In 2022 IEEE 9th International Conference on Data Science and Advanced Analytics. 1–10. https://doi.org/10.1109/DSAA54385.2022.10032351
  • Heston (1993) Steven Heston. 1993. A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options. Review of Financial Studies 6 (1993), 327–343. https://doi.org/10.1093/rfs/6.2.327
  • Heusel et al. (2017) Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter. 2017. GANs Trained by a Two Time-scale Update Rule Converge to a Local Nash Equilibrium. Advances in neural information processing systems 30 (2017). https://doi.org/10.5555/3295222.3295408
  • Hirano et al. (2022) Masanori Hirano, Hiroki Sakaji, and Kiyoshi Izumi. 2022. PGSGAN: Policy Gradient Stock GAN for Realistic Discrete Order Data Generation in Financial Markets. (2022). https://doi.org/10.48550/arXiv.2204.13338
  • Horvath et al. (2021a) Blanka Horvath, Aitor Muguruza, and Mehdi Tomas. 2021a. Deep learning volatility: a deep neural network perspective on pricing and calibration in (rough) volatility models. Quantitative Finance 21, 1 (2021), 11–27. https://doi.org/10.1080/14697688.2020.1817974
  • Horvath et al. (2021b) Blanka Horvath, Josef Teichmann, and Žan Žurič. 2021b. Deep Hedging under Rough Volatility. Risks 9, 7 (2021), 138. https://doi.org/10.3390/RISKS9070138
  • Imaki et al. (2023) Shota Imaki, Kentaro Imajo, Katsuya Ito, Kentaro Minami, and Kei Nakagawa. 2023. No-Transaction Band Network: A Neural Network Architecture for Efficient Deep Hedging. The Journal of Financial Data Science 5, 2 (2023), 84–99. https://doi.org/10.3905/jfds.2023.1.125
  • Li et al. (2020) Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, and Michael Wellman. 2020. Generating Realistic Stock Market Order Streams. AAAI Conference on Artificial Intelligence 34, 01 (2020), 727–734. https://doi.org/10.1609/aaai.v34i01.5415
  • Madry et al. (2017) Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. 2017. Towards Deep Learning Models Resistant to Adversarial Attacks. (2017). https://doi.org/10.48550/arXiv.1706.06083
  • Merton (1973) Robert C Merton. 1973. Theory of Rational Option Pricing. The Bell Journal of Economics and Management Science (1973), 141–183. https://doi.org/10.2307/3003143
  • Merton (1976) Robert C. Merton. 1976. Option pricing when underlying stock returns are discontinuous. Journal of Financial Economics 3, 1-2 (1976), 125–144. https://doi.org/10.1016/0304-405X(76)90022-2
  • Mikkilä and Kanniainen (2023) Oskari Mikkilä and Juho Kanniainen. 2023. Empirical Deep Hedging. Quantitative Finance 23, 1 (2023), 111–122. https://doi.org/10.1080/14697688.2022.2136037
  • Murray et al. (2022) Phillip Murray, Ben Wood, Hans Buehler, Magnus Wiese, and Mikko Pakkanen. 2022. Deep Hedging: Continuous Reinforcement Learning for Hedging of General Portfolios across Multiple Risk Aversions. In Proceedings of the Third ACM International Conference on AI in Finance. 361–368. https://doi.org/10.1145/3533271.3561731
  • Naritomi and Adachi (2020) Yusuke Naritomi and Takanori Adachi. 2020. Data Augmentation of High Frequency Financial Data Using Generative Adversarial Network. In 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT). IEEE, 641–648. https://doi.org/10.1109/WIIAT50758.2020.00097
  • Salimans et al. (2016) Tim Salimans, Ian Goodfellow, Wojciech Zaremba, Vicki Cheung, Alec Radford, and Xi Chen. 2016. Improved Techniques for Training GANs. Technical Report. 2234–2242 pages.
  • Taleb (1997) Nassim Nicholas Taleb. 1997. Dynamic Hedging. John Wiley & Sons.
  • Wiese et al. (2020) Magnus Wiese, Robert Knobloch, Ralf Korn, and Peter Kretschmer. 2020. Quant GANs: Deep Generation of Financial Time Series. Quantitative Finance 20, 9 (2020), 1419–1440.
  • Ziyin et al. (2022) Liu Ziyin, Kentaro Minami, and Kentaro Imajo. 2022. Theoretically Motivated Data Augmentation and Regularization for Portfolio Construction. In Proceedings of the Third ACM International Conference on AI in Finance. 273–281. https://doi.org/10.1145/3533271.3561720