Stochastic Gradient Descent in the Optimal Control of Execution Costs
Bertsimas and Lo's seminal work laid the groundwork for addressing the implementation shortfall dilemma in institutional investing, emphasizing the significance of market microstructure and price dynamics in minimizing execution costs. However, the ability to derive a theoretical Optimum market order policy is an unrealistic assumption for many investors. This study aims to bridge this gap by proposing an approach that leverages stochastic gradient descent (SGD) to derive alternative solutions for optimizing execution cost policies in dynamic markets where explicit mathematical solutions may not yet exist. The proposed methodology assumes the existence of a mathematically derived optimal solution that is a function of the underlying market dynamics. By iteratively refining strategies using SGD, economists can adapt their approaches over time based on evolving execution strategies. While these SGD-based solutions may not achieve optimality, they offer valuable insights into optimizing policies under complex market frameworks. These results serve as a bridge for economists and mathematicians, facilitating the study of the Optimum policy volatile markets while offering SGD driven implementable policies that closely approximate optimal outcomes within shorter time frames.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Conjugate gradient MIMO iterative learning control using data-driven stochastic gradients
Data-driven iterative learning control can achieve high performance for systems performing repeating tasks without the need for modeling. The aim of this paper is to develop a fast data-driven method for iterative learni…
Stochastic modified equations for the asynchronous stochastic gradient descent
We propose a stochastic modified equations (SME) for modeling the asynchronous stochastic gradient descent (ASGD) algorithms. The resulting SME of Langevin type extracts more information about the ASGD dynamics and eluci…
Learning Stochastic Optimal Policies via Gradient Descent
We systematically develop a learning-based treatment of stochastic optimal control (SOC), relying on direct optimization of parametric control policies. We propose a derivation of adjoint sensitivity results for stochast…
Portfolio OptimizationSensitivityContinuous-time stochastic gradient descent for optimizing over the stationary distribution of stochastic differential equations
We develop a new continuous-time stochastic gradient descent method for optimizing over the stationary distribution of stochastic differential equation (SDE) models. The algorithm continuously updates the SDE model's par…
Langevin algorithms for Markovian Neural Networks and Deep Stochastic control
Stochastic Gradient Descent Langevin Dynamics (SGLD) algorithms, which add noise to the classic gradient descent, are known to improve the training of neural networks in some cases where the neural network is very deep. …
Management