Optimal execution with rough path signatures^{1}^{1}1Opinions expressed in this paper are those of the authors, and do not necessarily reflect the view of JP Morgan.
Abstract
We present a method for obtaining approximate solutions to the problem of optimal execution, based on a signature method. The framework is general, only requiring that the price process is a geometric rough path and the price impact function is a continuous function of the trading speed. Following an approximation of the optimisation problem, we are able to calculate an optimal solution for the trading speed in the space of linear functions on a truncation of the signature of the price process. We provide strong numerical evidence illustrating the accuracy and flexibility of the approach. Our numerical investigation both examines cases where exact solutions are known, demonstrating that the method accurately approximates these solutions, and models where exact solutions are not known. In the latter case, we obtain favourable comparisons with standard execution strategies.
1
1 Introduction
1.1 Overview
The problem of optimal execution has attracted much interest following the original work on the problem by Bertsimas and Lo in [bertsimas] and Almgren and Chriss in [almgren]. The aim is to model how one should send orders to the market in order to transition from holding one portfolio to another. Typically the case where an investor simply wishes to acquire/liquidate shares in a single asset is considered. There are two competing factors to the optimisation. Firstly, the investor has pressure to trade quickly. Trading more at later times would mean accepting more risk, as the future prices are uncertain. On the other hand, trading evenly across time also has its benefits due to the nature of market impact. The investor should consider how much liquidity there currently is at desirable prices – placing a large order now could result in “walking the book” and accepting unfavourable prices for a large portion of their trade.
The key features in any optimal execution model are the dynamics of the price process at which the trader can execute her trades, , and some definition of the notion of a good strategy for the trader. The process is a function of the history of the trading speed until time , together with some additional driving processes. Typically, we have that is given by the sum of an underlying price process added to a price impact function. The price impact function depends on the history of the investor’s trading speed, and it determines how much the price at which the trader can execute has changed as a consequence of that. Classical choices of price impact functions include temporary versions, which depend only on the speed at which the trader wishes to trade at that time, permanent versions, which depend in the accumulation of orders placed until time , and transient versions, where the effects of past trading speeds decay with time. Good strategies are usually defined in terms of some cost functional, which takes into account both the expected revenue for the investor when employing a strategy, and some measure of the risk associated with that strategy.
1.2 Paper Outline
The aim of this paper is to show how the signature method can be used to obtain approximate solutions to the problem of optimal execution. Our setting is very general, with price processes assumed to be geometric rough paths only and the price impact function allowed to depend on the entire history of the trading strategy, with only a mild continuity condition assumed. The flexibility of the framework is demonstrated in part by the broad range of existing models in the literature which fall within it. An instance of this is the classical optimal execution problem presented in [carteabook, Section 6.5], in which the underlying price process is assumed to be a Brownian motion, with an penalty imposed based on the risk of holding inventory. More recent examples include the work of Lehalle and Neumann in [eyal] and Cartea and Jaimungal in [cartea2]. In [eyal], the authors prove results on the existence and uniqueness of an optimal trading strategy in the setting where trading signals are incorporated into the price dynamics. Similarly in [cartea2], the authors consider the role of microstructure in the problem by including order flow as a contributing factor permanently affecting the price. Our approach can also be adapted to handle models consisting of multiple correlated assets which are effected by trades in each other. Such a setting is presented in the article by Mastromatteo, Benzaquen, Eisler and Bouchaud, [crossasset2].
We begin the paper with a brief overview of rough paths in Section 2. Here, we define geometric rough paths and their signatures, and introduce the underlying algebraic structures required to perform calculations on the signatures. Following this, we introduce our framework in Section 3. This consists of specifying our assumptions on the price process and market impact in our model, defining the space of trading speeds in which we will look for strategies, and introducing the optimal control problem. Section 4 is dedicated to calculating approximate solutions to the control problem. We first reformulate the problem in terms of the signature, and then we approximate the optimal trading speed by a finitedimensional, computationally tractable minimisation problem. In Section 5, we provide examples of interesting extensions of the approach as it was presented in Sections 3 and 4, such as the multiple asset problem which appears in [crossasset2], and more exotic models where additional multidimensional noise is assumed to provide exogenous information about the price dynamics. Finally in Section 6 and Section 7, we provide numerical evidence that the model performs well. Good approximations to the optimal strategies in the settings [carteabook, Section 6.5], [eyal] and [cartea2] are obtained, and we also investigate the problem in the case where the underlying price process is a fractional Brownian motion. Moreover, we demonstrate in Section 7 that our methodology can also be used on real market data.
2 Rough paths preliminaries
Rough paths and signatures will play a key role in this paper. In this section we will introduce all the aspects of rough paths theory that will be used in the article. For a more detailed introduction to the theory of rough paths, the authors refer the reader to [lyonsbook, frizvictoir].
2.1 Tensor algebra
A rough path is a path that takes value on a certain graded space, called the tensor algebra. This subsection will introduce these algebras, as well as another crucial space – the dual space of the tensor algebra.
Definition 2.1 (Extended tensor algebra).
Let . We denote by the extended tensor algebra over , which is defined by
where denotes the tensor product. Given , define the sum and product by
We also define the action on given by for all , .
Similarly, we can define the tensor algebra and truncated tensor algebra as the space of all finite sequences and all sequences of a given length, respectively.
Definition 2.2.
The tensor algebra over , denoted by , is given by
Similarly, the truncated tensor algebra of order over is defined by
Let be a basis for . This induces a dual basis for , where denotes the dual space of – i.e. the space of all continuous linear functions . We may define a basis for by:
Similarly, a basis of is defined by
This induces, in a natural way, a basis for and .
It is often convenient to think of as a space of words. Define the alphabet . Then, the basic element can be identified with the word . Let denote the space of all words (and their sums) with letters in the dictionary , i.e. the free vector space generated by . Then, we have . The empty word will be denoted by .
Example 2.3.
Consider the following examples for .

Let . Then, .

Let , and set . Then, .

Let , and set . Then, .

Let and . Then, .
The space of words possesses two natural algebraic operations – the sum and the concatenation. Let be two words. Their sum is the formal sum . Their concatenation, on the other hand, is defined by
These two operations induce analogous operations on , and with some abuse of notation we will even use concatenation on and interchangeably – i.e. we will sometimes write for and word , by which we mean that we take the concatenation of the element in associated to and the word .
Example 2.4.
Take the alphabet .

Set . We have .

We have .
There is a third operation on words that will be useful in this paper: the shuffle product . Intuitively, the shuffle product accounts for all the possible ways of riffle shuffling two decks of cards. The precise definition is given below.
Definition 2.5 (Shuffle product).
The shuffle product is defined inductively by
for all words and letters , which is then extended by bilinearity to . With some abuse of notation, the shuffle product on induced by the shuffle product on words will also be denoted by .
It follows from the definition of the shuffle product that is commutative, i.e. for all .
Example 2.6.
We have:

.

.
Definition 2.7.
Let be a polynomial on one variable. Write . Then, induces the map given by
where for .
2.2 Rough paths
We will now define a crucial object in this paper: the signature of a path.
Definition 2.8 (Signature of a path).
Let . For a piecewise smooth path , we define the signature of over by
where
Similarly, we define the truncated signature of order by
If we refer to the signature of , without referencing the interval over which the signature is taken, we will implicitly refer to .
Example 2.9.
Throughout this paper, we will constantly work with linear functions on the signature. Therefore, it will be useful to see a few examples that will be used in later sections.
Let be a twodimensional smooth path. Recall that in Section 2.1 we introduced the notation of words as linear functions on the tensor algebra. We have:

.

.

.

Let . Then, .
Definition 2.10 (Geometric rough paths).
Let and . Denote by the integer part of . Let . A function is said to be a geometric rough path if it is the limit (under the variation distance, [lyonsbook, Definition 1.5]) of signatures of order of piecewise smooth paths. The space of all geometric rough paths will be denoted by .
Each can be uniquely extended to a geometric rough path for any ([lyonsbook, Theorem 3.7]). Analogously to the smooth case, the full extension will be defined as the signature of .
Many stochastic processes that are used in the literature are almost surely geometric rough paths. For example, the signature of a semimartingale, defined using Stratonovich integration, is almost surely a geometric rough path for any [semimartingalesgeometric]. The signature of a fractional Brownian motion for Hurst parameter , defined almost surely, is also a geometric rough path for ([fractionalbmgeometric]). We will now state some properties of signatures that will be useful in this article.
Lemma 2.11 (Shuffle product property, [lyonsbook]).
Let be a geometric rough path. Let be two linear functionals. Then,
(1) 
The shuffle product will be extensively used throughout this paper. It guarantees that the product of two linear functions on the signature is another linear function on the signature, which is given explicitly in terms of the shuffle product.
The following lemma will also be useful in this paper. This result guarantees that the signature completely characterises – up to the socalled treelike equivalences (see [horatio, Definition 1.1]).
Lemma 2.12 (Uniqueness of signatures, [horatio]).
Let . The signature of is unique up to treelike equivalences (defined in [horatio, Definition 1.1]).
Corollary 2.13.
Let . If there exists a projection of that is strictly monotone, then the signature determines up to translations.
3 Framework
3.1 Notation
Given a continuous path , denote its augmentation by the continuous path defined by .
Let . Define:
where the closure is taken under , i.e. the variation distance (see [lyonsbook, Definition 1.5]). Given , we will write by the unaugmented coordinate process.
Intuitively, elements of are signatures of paths of the form , with initial point . Because the first dimension of this augmented path (namely, time) is monotone increasing, and because we are only considering paths that start at 1, it follows by Corollary 2.13 that completely characterises (and hence ).
3.2 The market
The space will be our space of market paths. We will equip it with a probability space . Given a rough path , the unaugmented coordinate path will denote the unaffected midprice of the asset. In other words, is the midprice process of the asset if the trader does not trade on the asset.
Example 3.1.
Our market framework is very general in the sense that it includes most of the examples that have been considered in the literature. In particular, our framework includes:

Semimartingales. In the literature [cartea1, cartea2, cartea3, eyal], the midprice process is often modelled as a semimartingale. Semimartingales can be lifted to geometric rough paths for [lyonsoriginal, semimartingalesgeometric, frizvictoir], and therefore they fit into our framework: the market would be given by the probability space for and the law of the semimartingale.

Lévy processes. More generally, certain Lévy processes can also be lifted into geometric rough paths [levy, levy2] and they are thus included in this framework.

Fractional brownian motion. Our framework also includes the setting where the midprice is modelled by a fractional brownian motion with Hurst parameter . Indeed, it was shown in [fractionalbmgeometric] that fractional Brownian motions with Hurst parameter greater than 1/4 can be lifted to geometric rough paths.
3.3 Trading speeds
In this section, we will introduce the notation of trading speeds.
Definition 3.2 (Trading speeds).
Define the metrizable space . We define the space of trading speeds by . Given a trading speed , the trader will trade a rate of .
Intuitively, the trader that is sitting at time should decide how much to sell or buy by only considering what happened up to time : she can only act based on the past, not the future. In other words, the trader’s trading decision will be a (nonanticipative) function of the midprice process up to time , i.e. . This intuition is incorporated into the definition of the trading speeds . A space similar to was considered in [lambdaspace1, lambdaspace2, lambdaspace3, lambdaspace4, lambdaspace5, lambdaspace6], and a similar definition of trading strategies was considered in [lambdaspace6].
In this paper, the following class of trading speeds will have a special relevance:
Definition 3.3 (Signature trading speeds).
The space of signature trading speeds is defined by
where denotes the signature of over the interval .
It turns out that the space of signature trading speeds is very large – in fact, we have the following density result, whose proof is in Appendix A.
Lemma 3.4.
Let . Then, there exists a compact set such that:

.

, restricted to , is dense in .
Therefore, trading speeds can be locally approximated arbitrarily well by signature trading speeds. Hence, if one wants to optimise a certain objective function over , it makes sense to optimise it over instead. This is precisely the approach that will be followed in this paper: we will look for an optimal trading speed in , instead of .
3.4 Market impact
When a trader buys or sells a traded asset, the mere act of trading will affect the asset’s order book. If the volume she trades is small compared to the overall volume, this effect may be neglected. However, if the trader sends large trading orders the impact on the order book may negatively affect the price at which the order is executed (see [marketimpact] and the references therein). In this section we will introduce the market impact model that will be used in this paper.
If the trader decides to follow a signature trading speed , the execution price – i.e. the price the trader has access to – will be given by
(2) 
where is a linear functional that depends on that models the market impact.
Example 3.5.
The definition of the market impact, far from being restrictive, is very general and includes many examples that have been studied in the literature. Indeed, let and set the signature trading speed . Then, the following are examples of market impacts included in our framework:

Temporary market impact. Set , with . Then, is the linear temporary market impact studied in [cartea1, cartea2, eyal]. We may also make the temporary market impact nonlinear by considering a polynomial and setting . Then, .

Permanent market impact. In [cartea1, cartea2, cartea3], a permanent market impact given by is considered. Setting , we have .

Transient market impact. In [transient1, transient2, transient3] the authors considered a transient market impact that is given by , where for constant. Then, we can find such that
to arbitrary accuracy.

More generally, market impacts modelled by functions of the form can be wellapproximated by linear functions on the signature, and they are therefore included in our framework.
3.5 Optimal execution problem
Suppose the trader wishes to liquidate units of the asset by time . If is large compared to the traded volume, the trading activity will affect the price of the asset ([marketimpact]) negatively for the trader. Therefore, it may be more beneficial to spread the trading activity over the interval to avoid the undesired market impact. In this case, however, the trader will be exposed to market fluctuations that may affect her adversely. Hence, the task is to find a suitable trading speed to liquidate the inventory which accounts for this tradeoff. We will now introduce the optimal execution problem that will be studied in this paper.
Definition 3.6.
The wealth corresponding to the trading speed is defined by
On the other hand, the remaining inventory is defined by
where is the initial inventory. We define the cost function by
(3) 
with constants.
In this paper we will study the following optimal execution problem given by the optimisation problem
(4) 
The first term of the cost function indicates that, in principle, the trader would like to maximise the wealth acquired by following the trading strategy . If the investor arrives the terminal time with a nonzero inventory , the third term of the cost function ensures that these leftovers are executed with a penalisation . Finally, the term penalises holding inventory for a long time. There are different interpretations for this term. For instance, this running inventory penalty could be seen as an urgency term. Another interpretation comes from the setting where the investor would like to account for model uncertainty: the larger is, the less certain the trader is about the dynamics imposed on the midprice (see [cartea2, cartea4]). In any case, a large would increase the trading speed near the beginning, and reduce it near the end.
This particular cost function was chosen due to its popularity in the literature [cartea1, eyal, cartea2, transient1, transient2, cartea3, transient3], but the authors would like to emphasise that the methodology proposed in this paper also applies to other alternative definitions of the cost function, and we are not restricted to this particular choice of .
Properties of signatures, and the shuffle product property (1) in particular, will make finding the optimal trading speed for the optimal control problem (4) in the restricted space easier to solve. Due to the density result stated in Lemma 3.4, we will restrict the space of trading speeds from to , so that we will solve the following problem instead:
(5) 
4 Optimal execution
The cost function (3) is a nonlinear function of the underlying price path. However, for signature trading strategies it turns out to be a linear function on the signature of the midprice process. This is due to the shuffle product property (1) – each term in the cost function can be rewritten as a linear function on the signature of the midprice process.
Lemma 4.1.
Let be the signature trading speed given , with . Then, given any and , we have

.



.
Proof.
Let and .

Notice that, because , we have for each . Then, by the shuffle product property (1),

Follows from the fact that .

Using (ii),

Using (ii) again,
∎
Therefore, the optimal liquidation problem (4) is then transformed into the following problem:
Proposition 4.2.
Let be the signature trading speed given , with . Then, given any and , the cost function can be written as
Therefore, the optimal liquidation problem (4) is reduced to
(6)  
The cost function depends on two aspects: a stochastic component and the control . Moreover, this dependency is nonlinear. Proposition 4.2 separates this dependency into a deterministic component that solely depends on the control, and on a stochastic component that does not depend on the control. Moreover, because this separation makes the cost function linear on the path, the expectation in (3) is moved inside linear functional – in other words, the resulting optimisation problem (6) depends on the expected signature of the midprice process.
The expected signature of the midprice process is the only dependency on the stochastic process. This object plays the analogous role of the moments of a random variable, but on path space. It was shown in fact in [chevyrev2016characteristic] that under certain growth assumptions, the expected signature determines the law of the stochastic process. Therefore, the fact that (6) depends on the expected signature of the midprice process essentially implies that the optimisation problem depends on the entire law of the process.
4.1 Numerically solving the optimal execution problem
The optimisation problem (6) from Proposition 4.2 involves the full expected signature . In practice, however, one has to consider the truncated expected signature of order , i.e. .
However, the fast decay of the signature – it decays factorially – implies that the first few terms will dominate the rest, and not much information will be lost in the truncation. As a consequence, the expected signature typically also decays factorially ([chevyrev2016characteristic] for instance showed this fact for wide classes of Lévy, Markov and Gaussian processes).
Figure 1 shows plotted against in the case where the midprice process is a Brownian motion. As we see, the factorial decay makes higher order terms small compared to the first few terms. Therefore, in practice one doesn’t need to consider truncations of very high order.
Once the signature is truncated at a certain level , the optimisation problem (6) consists of finding the global maximum of a certain polynomial in several variables. For example, one can show that if a linear permanent and temporary market impact is considered, the polynomial is a quadratic polynomial, and finding the optimal trading speed will be reduced to finding the (unique) global maximum of a quadratic polynomial in several variables.
Regarding the computation of the truncated expected signature, Monte Carlo methods can be used for this task. Therefore, the only knowledge about the midprice process that is needed to solve the optimal execution problem is how to sample from the path. The signature of a single realisation can be computed using publicly available software such as esig^{2}^{2}2https://pypi.org/project/esig/ or iisignature^{3}^{3}3https://pypi.org/project/iisignature/.
5 Extensions
In Section 4, we studied a certain optimal liquidation problem. In the present section we analyse different extensions of the problem, and we study how they fit in our framework.
5.1 Modelling the execution price with exogeneous information
For , in Section 3.4 the market impact was defined as a function of the trading speed and the unaffected midprocess:
(7) 
However, there are other factors that affect the impact of a trading order [exogeneousimpact1, exogeneousimpact2]. For instance, one may want to incorporate the total traded volume in the market impact [exogeneousimpact2]. Moreover, correlation and crossasset impact between similar assets will also play a role: the execution price of an order may depend on the midprice process of other assets [exogeneousimpact1, crossasset, crossasset2].
This feature can be incorporated to our framework, by modelling the execution price by
(8) 
where is the signature of , with the total traded volume up to time and are the midprice processes of alternative assets that the trader believes that affect the execution price of the main asset. Notice that (7) is a particular case of (8). Other exogenous information may also be added to .
5.2 Optimal trading, as opposed to liquidation
In this paper we have been focusing on the case where a trader has an initial inventory at , and she would like to get rid of it by time . However, certain highfrequency traders may be interested in the following alternative question: if one starts with no inventory at and one would like to finish with no inventory at , what is the best trading strategy that can be followed on ? This paper’s framework can be modified for this purpose by redefining the inventory in Definition 3.6 by setting .
5.3 Crossasset portfolio liquidation
The discussion on Section 5.1 suggests another extension of the original problem studied in this paper. Suppose there are assets and a trader has an initial portfolio . If the trader wishes to liquidate the inventory (see [crossasset, crossasset2]), she can consider an optimal control problem similar to (9) that incorporates her risk profile.
More generally, the trader could aim to transition from a starting portfolio on traded assets, to a final portfolio , and she would like to do so in an optimal way. Again, our framework can be adapted for this task.
5.4 Other cost functions
The cost function considered in (4) was chosen in order to be consistent with the literature [cartea1, eyal, cartea2, transient1, transient2, cartea3, transient3]. However, the methodology we propose is not intrinsic to this cost function, and it can be applied to other cost functions that the trader may find more appropriate.
6 Numerical experiments
In this section we implement the proposed methodology and test it on different settings. We begin by showing that, when we apply the methodology to various settings studied in the literature, we retrieve the existing results, thus reaffirming that our framework is a generalisation of many frameworks considered in the literature and validating the trading strategy returned by the signature methodology. Then, we apply our approach to new settings.
6.1 Brownian motion with temporary and permanent market impact
In this section we will consider the framework studied in [carteabook, Section 6.5]. We will assume that the unaffected midprice process follows a Brownian motion with volatility , that is, with and a Brownian motion. For a signature trading speed given by with , the execution price will be given by a permanent market impact and a temporary market impact:
with .
It was mentioned in Section 3.4 that this market impact is included in our framework. More specifically, we have:
with .
We may then solve (6). The chosen parameters were , , , , and , and different values for were considered. Truncated signatures of order 7 were considered to solve (6). As it has been established in the literature (see [carteabook, Section 6.5]) the optimal trading speed does not depend on the midprice. Moreover, if we set so that no running inventory penalties are considered, it is known that the optimal trading speed is constant. On the other hand, when is increased, the trader decides to liquidate the inventory sooner. All this features are captured in the results we obtained – see Figure 2.
6.2 Incorporating trading signals
Lehalle and Neuman in [eyal] considered an optimal liquidation problem where the investor has access to some trading signal that predict shortterm price movements, such as order book imbalance.
In this case, the midprice process was taken to be , where is the signal process, is volatility and is a Brownian motion. In the original paper [eyal], the signal that was considered was an OrnsteinUhlenbeck process , where are constants. Therefore, given that the midprice process is a semimartingale, this example also falls within our framework.
The price impact that was considered in [eyal] was a linear temporary price impact. Therefore, the execution price will be given by (2), where with .
Figure 3 shows the running inventory for 100 realisations of the midprice process, both for the signature trading speed and the optimal trading speed that was derived in [eyal]. The chosen parameters were , , and . Truncated signatures of order 9 were considered. As we see, the signature trading speed seems to be a close approximation of the theoretical optimal speed. The numerical expected cost of the signature trading speed is 1.0169981 whereas the optimal trading speed’s expected cost is 1.0170877.
Notice that the presence of the signal in the midprice process introduces a positive drift, and therefore, as illustrated by Figure 3, it is optimal to begin by purchasing shares in order to sell them for a profit later. This could be avoided by increasing the running inventory penalty .
6.3 Incorporating orderflow
In [cartea2], the authors incorporate the orderflow of all agents into the midprice dynamics. This is done by considering the midprice process
where and are the aggregated buying and selling orders of all market participants, respectively. These orders are assumed to follow the dynamics
with independent Poisson processes of intensity , and has an exponential distribution. Moreover, a temporary market impact was included as well.
Figure 4 shows the inventory for 100 realisations of the midprice path, both for the signature trading speed and the optimal trading speed that was derived in [cartea2]. The expected cost function of the signature trading speed is 0.995690, very close to the expected cost of the optimal speed: 0.995722. The parameters we considered are , , , , , , , and signatures of order 7.
6.4 Fractional Brownian motion
In this section, we assume that the midprice process is a fractional Brownian motion. We assume a linear market impact. In other words, the execution price will be given by
where is a fractional Brownian motion with Hurst parameter , and are constants.
Figure 5 shows the midprice and inventory in the case where , , , , , , and truncated signatures of order 7 are considered.
As we see, the behaviour differs significantly from the case where (i.e. when is a Brownian motion). Indeed, given that we don’t include a running inventory penalty as , in the Brownian case we would expect the inventory to be linear. However, Figure 5 illustrates that this is not the case for the fractional Brownian motion, and the trading speed depends strongly on the midprice process. In fact, if we look at the expected cost of the constant trading speed – it is given by 0.9991335 – we see that the signature trading speed for the fractional Brownian motion outperforms the constant trading speed strategy – the expected cost of the signature trading speed is 1.0031300. This is outperformance of the signature trading speed is reflected in the wealth distribution of both strategies shown in Figure 5 (right).
7 Experiments with market data
To solve (6), the only information that is needed about the midprice process is its expected signature. In this section, we use real market data to estimate the expected signature, which is then used to solve (6). Then, we evaluated the performance of the optimal execution strategy in an outofsample set of market paths.
We considered midprice market data of Apple (AAPL) for 1 year, from the 1^{st} of January 2018 to the 31^{st} of December 2018, which was obtained from LOBSTER^{4}^{4}4https://lobsterdata.com/. This data was divided into a training set of 10 months (January–October) and an outofsample set of 2 months (November–December).
We considered 15 minute windows from different times of each trading day – more specifically, we considered 10:00–10:15, 11:00–11:15, 12:00–12:15 and 13:00–13:15. We estimated the expected signature over each of these 15 minute windows by computing the empirical expectation of the signature (signatures of order 13 were considered) of the corresponding 15 minute windows from the testing set. Therefore, to some extent, we assume that the midprice process follows a similar behaviour over each of the windows throughout the trading year.
Once the expected signature of the midprice process for each of the 15 minute windows is estimated from the training set, we solved the optimisation problem (6) to estimate the optimal signature trading speed. We included a temporary and market impact:
The parameters we used where , , and . We then evaluated the performance on the outofsample set for each of the 15 minute windows. Following [cartea2], we compared the performance against the Almgren–Chriss execution strategy [almgren]. More specifically, we considered the savings per share metric (in basis points) that was used in [cartea2], which is defined by
where and are the terminal wealth of the optimal signature trading speed and Almgren–Chris execution strategy, respectively.
The results are shown in Figure 6. The optimal signature trading speed outperforms the Almgren–Chriss benchmark on all 15minute windows, as on average the savings per share of the signature trading speed is positive.
Notice that the only assumption we have made is that the midprice process behave similarly on the same 15minute window across different trading days. Other than that, our approach is modelfree: we can, in a nonparametric and modelfree way, estimate the optimal trading speed from market data.
8 Conclusion
In this paper we propose a methodology to numerically approximate the solution of certain optimal execution problems. This is done in the general framework of geometric rough paths, which in particular contains many existing models in the literature.
Rough path signatures provide a methodology to reduce the original optimisation problem into a finitedimensional, computationally feasible optimisation problem. The only information that is needed from the underlying price process is its expected signature, which can be computed using Monte Carlo methods.
This approach was tested in Section 6, where we show that in those cases where the optimal trading speed is known, the signaturebased numerical approach is capable of retrieving it. Moreover, the generality of the approach allows the estimation of the optimal trading speed in those settings where the optimal solution is unknown. In Section 7 on the other hand, we showed how our methodology can be used in real market data and we demonstrated that the signature approach outperforms the Almgren–Chriss benchmark.
Appendix A Proofs
Proof of Lemma 3.4.
Let . Because is reflexive, there exists compact such that .
Let . Then, by definition there exist linear functionals such that for all . Define . Then, by the shuffle product property (1) we have
Therefore, and because the sum of two signature trading speeds is trivially a signature trading speed, form an algebra. On the other hand, the uniqueness of the signature (Corollary 2.13) implies that separates points. Indeed, given distinct, because we have we immediately have that there exists such that . Moreover, contains constants, as for all . Therefore, by Stone–Weierstrass theorem we conclude that , restricted to , is dense in . ∎
Acknowledgments
This work was supported by The Alan Turing Institute under the EPSRC grant EP/N510129/1. The authors would like to thank Sebastian Jaimungal, Alvaro Cartea and Leandro Leandro Sanchez Betancourt for reading a preprint of this paper and for giving their insights.
Disclosure statement
Opinions and estimates constitute our judgement as of the date of this Material, are for informational purposes only and are subject to change without notice. This Material is not the product of J.P. Morgans Research Department and therefore, has not been prepared in accordance with legal requirements to promote the independence of research, including but not limited to, the prohibition on the dealing ahead of the dissemination of investment research. This Material is not intended as research, a recommendation, advice, offer or solicitation for the purchase or sale of any financial product or service, or to be used in any way for evaluating the merits of participating in any transaction. It is not a research report and is not intended as such. Past performance is not indicative of future results. Please consult your own advisors regarding legal, tax, accounting or any other aspects including suitability implications for your particular circumstances. J.P. Morgan disclaims any responsibility or liability whatsoever for the quality, accuracy or completeness of the information herein, and for any reliance on, or use of this material in any way.
Important disclosures at: www.jpmorgan.com/disclosures.