Paper: arXiv 2412.12199

Authors: Simeon Kolev

Abstract

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.

Complexity vs Empirical Score

  • Math Complexity: 8.5/10
  • Empirical Rigor: 6.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper heavily employs advanced mathematics, including stochastic dynamic programming, Bellman equations, and detailed SGD variants with complex update rules, indicating high mathematical density. While it lacks reported backtest results or real-world data, the methodology is inherently data-driven, requiring iterative refinement of execution strategies based on simulated or historical price dynamics, suggesting strong empirical implementation readiness.

Research Flowchart

  flowchart TD
  A["Research Goal:<br>Optimize execution costs<br>in dynamic markets"] --> B["Methodology:<br>Stochastic Gradient Descent<br>SGD"]
  B --> C["Data/Inputs:<br>Market Microstructure &<br>Price Dynamics"]
  C --> D["Computational Process:<br>Iterative Policy Refinement<br>via SGD"]
  D --> E["Outcome:<br>Implementable Approximate<br>Optimal Policies"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes using stochastic gradient descent (SGD) to derive alternative execution cost policies in dynamic markets where explicit optimal solutions may not exist.

Source sentence
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.

Assumes 1

  • The existence of a mathematically derived optimal solution that is a function of the underlying market dynamics is assumed. model
    Source sentence
    The proposed methodology assumes the existence of a mathematically derived optimal solution that is a function of the underlying market dynamics.

Data

Synthetic data only.

Costs

Modeled Costs are part of the reported headline results.

Source sentence
After properly tuning the SGD algorithms, I will compare each model’s predicted optimum purchasing order size, the total accumulated execution cost, and the per period variance in the SGD’s strategy vs the Optimum strategy.

Finds 3

  • SGD strategies displayed significantly increased variance in order size (Bt) but produced relatively similar total accumulated execution costs compared to the optimal strategy. performance
    Source sentence
    Though the SGD strategies displayed a significant increased variance in Bt, the algorithms still produced relatively similar total accumulated execution costs.
  • The SGD-derived optimal order sizes and total execution costs are negligibly suboptimal relative to the true mathematical optimum. performance
    Source sentence
    Comparative analysis shows that the unique mathematical optimal is the true minimum execution cost, however, the SGD derived optimal Bt and total execution costs are negligibly suboptimal.
  • None of the SGD algorithms were able to beat the optimum strategy, yet they converged to a relative optimum in practice. performance
    Source sentence
    14 Conclusion In conclusion, even though none of the SGD algorithms were not able to beat the Optimum strategy derived by Bertsimas and Lo in the “Optimal Control of Execution Costs” (1998), the algorithms were able to derive alternative strategies that achiever relative converge to the true optimum solution, in practice.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 23 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.