IDEAS home Printed from https://ideas.repec.org/a/taf/quantf/v24y2024i1p15-34.html
   My bibliography  Save this article

On parametric optimal execution and machine learning surrogates

Author

Listed:
  • Tao Chen
  • Mike Ludkovski
  • Moritz Voß

Abstract

We investigate optimal order execution problems in discrete time with instantaneous price impact and stochastic resilience. First, in the setting of linear transient price impact we derive a closed-form recursion for the optimal strategy, extending the deterministic results from Obizhaeva and Wang [Optimal trading strategy and supply/demand dynamics. J. Financial Mark., 2013, 16(1), 1–32]. Second, we develop a numerical algorithm based on dynamic programming and deep learning for the case of nonlinear transient price impact as proposed by Bouchaud et al. [Fluctuations and response in financial markets: The subtle nature of ‘random’ price changes. Quant. Finance, 2004, 4(2), 176–190]. Specifically, we utilize an actor-critic framework that constructs two neural-network (NN) surrogates for the value function and the feedback control. The flexible scalability of NN functional approximators enables parametric learning, i.e. incorporating several model or market parameters as part of the input space. Precise calibration of price impact, resilience, etc., is known to be extremely challenging and hence it is critical to understand the sensitivity of the execution policy to these parameters. Our NN learner organically scales across multiple input dimensions and is shown to accurately approximate optimal strategies across a wide range of parameter configurations. We provide a fully reproducible Jupyter Notebook with our NN implementation, which is of independent pedagogical interest, demonstrating the ease of use of NN surrogates in (parametric) stochastic control problems.

Suggested Citation

  • Tao Chen & Mike Ludkovski & Moritz Voß, 2024. "On parametric optimal execution and machine learning surrogates," Quantitative Finance, Taylor & Francis Journals, vol. 24(1), pages 15-34, January.
  • Handle: RePEc:taf:quantf:v:24:y:2024:i:1:p:15-34
    DOI: 10.1080/14697688.2023.2282657
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/14697688.2023.2282657
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/14697688.2023.2282657?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:quantf:v:24:y:2024:i:1:p:15-34. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RQUF20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.