Stochastic Gradient Descent

Uncertainty-Aware Strategies: A Model-Agnostic Framework for Robust Financial Optimization through Subsampling ArXiv ID: 2506.07299 “View on arXiv” Authors: Hans Buehler, Blanka Horvath, Yannick Limmer, Thorsten Schmidt Abstract This paper addresses the challenge of model uncertainty in quantitative finance, where decisions in portfolio allocation, derivative pricing, and risk management rely on estimating stochastic models from limited data. In practice, the unavailability of the true probability measure forces reliance on an empirical approximation, and even small misestimations can lead to significant deviations in decision quality. Building on the framework of Klibanoff et al. (2005), we enhance the conventional objective - whether this is expected utility in an investing context or a hedging metric - by superimposing an outer “uncertainty measure”, motivated by traditional monetary risk measures, on the space of models. In scenarios where a natural model distribution is lacking or Bayesian methods are impractical, we propose an ad hoc subsampling strategy, analogous to bootstrapping in statistical finance and related to mini-batch sampling in deep learning, to approximate model uncertainty. To address the quadratic memory demands of naive implementations, we also present an adapted stochastic gradient descent algorithm that enables efficient parallelization. Through analytical, simulated, and empirical studies - including multi-period, real data and high-dimensional examples - we demonstrate that uncertainty measures outperform traditional mixture of measures strategies and our model-agnostic subsampling-based approach not only enhances robustness against model risk but also achieves performance comparable to more elaborate Bayesian methods. ...

Stochastic Gradient Descent in the Optimal Control of Execution Costs ArXiv ID: 2412.12199 “View on arXiv” Authors: Unknown 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. ...

A Comprehensive Analysis of Machine Learning Models for Algorithmic Trading of Bitcoin ArXiv ID: 2407.18334 “View on arXiv” Authors: Unknown Abstract This study evaluates the performance of 41 machine learning models, including 21 classifiers and 20 regressors, in predicting Bitcoin prices for algorithmic trading. By examining these models under various market conditions, we highlight their accuracy, robustness, and adaptability to the volatile cryptocurrency market. Our comprehensive analysis reveals the strengths and limitations of each model, providing critical insights for developing effective trading strategies. We employ both machine learning metrics (e.g., Mean Absolute Error, Root Mean Squared Error) and trading metrics (e.g., Profit and Loss percentage, Sharpe Ratio) to assess model performance. Our evaluation includes backtesting on historical data, forward testing on recent unseen data, and real-world trading scenarios, ensuring the robustness and practical applicability of our models. Key findings demonstrate that certain models, such as Random Forest and Stochastic Gradient Descent, outperform others in terms of profit and risk management. These insights offer valuable guidance for traders and researchers aiming to leverage machine learning for cryptocurrency trading. ...

Machine Learning Methods for Pricing Financial Derivatives ArXiv ID: 2406.00459 “View on arXiv” Authors: Unknown Abstract Stochastic differential equation (SDE) models are the foundation for pricing and hedging financial derivatives. The drift and volatility functions in SDE models are typically chosen to be algebraic functions with a small number (less than 5) parameters which can be calibrated to market data. A more flexible approach is to use neural networks to model the drift and volatility functions, which provides more degrees-of-freedom to match observed market data. Training of models requires optimizing over an SDE, which is computationally challenging. For European options, we develop a fast stochastic gradient descent (SGD) algorithm for training the neural network-SDE model. Our SGD algorithm uses two independent SDE paths to obtain an unbiased estimate of the direction of steepest descent. For American options, we optimize over the corresponding Kolmogorov partial differential equation (PDE). The neural network appears as coefficient functions in the PDE. Models are trained on large datasets (many contracts), requiring either large simulations (many Monte Carlo samples for the stock price paths) or large numbers of PDEs (a PDE must be solved for each contract). Numerical results are presented for real market data including S&P 500 index options, S&P 100 index options, and single-stock American options. The neural-network-based SDE models are compared against the Black-Scholes model, the Dupire’s local volatility model, and the Heston model. Models are evaluated in terms of how accurate they are at pricing out-of-sample financial derivatives, which is a core task in derivative pricing at financial institutions. ...

Swing contract pricing: with and without Neural Networks ArXiv ID: 2306.03822 “View on arXiv” Authors: Unknown Abstract We propose two parametric approaches to evaluate swing contracts with firm constraints. Our objective is to define approximations for the optimal control, which represents the amounts of energy purchased throughout the contract. The first approach involves approximating the optimal control by means of an explicit parametric function, where the parameters are determined using stochastic gradient descent based algorithms. The second approach builds on the first one, where we replace parameters in the first approach by the output of a neural network. Our numerical experiments demonstrate that by using Langevin based algorithms, both parameterizations provide, in a short computation time, better prices compared to state-of-the-art methods. ...