Deep BSDE

Breaking the Dimensional Barrier: A Pontryagin-Guided Direct Policy Optimization for Continuous-Time Multi-Asset Portfolio Choice ArXiv ID: 2504.11116 “View on arXiv” Authors: Unknown Abstract We introduce the Pontryagin-Guided Direct Policy Optimization (PG-DPO) framework for high-dimensional continuous-time portfolio choice. Our approach combines Pontryagin’s Maximum Principle (PMP) with backpropagation through time (BPTT) to directly inform neural network-based policy learning, enabling accurate recovery of both myopic and intertemporal hedging demands–an aspect often missed by existing methods. Building on this, we develop the Projected PG-DPO (P-PGDPO) variant, which achieves nearoptimal policies with substantially improved efficiency. P-PGDPO leverages rapidly stabilizing costate estimates from BPTT and analytically projects them onto PMP’s first-order conditions, reducing training overhead while improving precision. Numerical experiments show that PG-DPO matches or exceeds the accuracy of Deep BSDE, while P-PGDPO delivers significantly higher precision and scalability. By explicitly incorporating time-to-maturity, our framework naturally applies to finite-horizon problems and captures horizon-dependent effects, with the long-horizon case emerging as a stationary special case. ...

A deep BSDE approach for the simultaneous pricing and delta-gamma hedging of large portfolios consisting of high-dimensional multi-asset Bermudan options ArXiv ID: 2502.11706 “View on arXiv” Authors: Unknown Abstract A deep BSDE approach is presented for the pricing and delta-gamma hedging of high-dimensional Bermudan options, with applications in portfolio risk management. Large portfolios of a mixture of multi-asset European and Bermudan derivatives are cast into the framework of discretely reflected BSDEs. This system is discretized by the One Step Malliavin scheme (Negyesi et al. [“2024, 2025”]) of discretely reflected Markovian BSDEs, which involves a $Γ$ process, corresponding to second-order sensitivities of the associated option prices. The discretized system is solved by a neural network regression Monte Carlo method, efficiently for a large number of underlyings. The resulting option Deltas and Gammas are used to discretely rebalance the corresponding replicating strategies. Numerical experiments are presented on both high-dimensional basket options and large portfolios consisting of multiple options with varying early exercise rights, moneyness and volatility. These examples demonstrate the robustness and accuracy of the method up to $100$ risk factors. The resulting hedging strategies significantly outperform benchmark methods both in the case of standard delta- and delta-gamma hedging. ...

Deep Penalty Methods: A Class of Deep Learning Algorithms for Solving High Dimensional Optimal Stopping Problems ArXiv ID: 2405.11392 “View on arXiv” Authors: Unknown Abstract We propose a deep learning algorithm for high dimensional optimal stopping problems. Our method is inspired by the penalty method for solving free boundary PDEs. Within our approach, the penalized PDE is approximated using the Deep BSDE framework proposed by \cite{“weinan2017deep”}, which leads us to coin the term “Deep Penalty Method (DPM)” to refer to our algorithm. We show that the error of the DPM can be bounded by the loss function and $O(\frac{“1”}λ)+O(λh) +O(\sqrt{“h”})$, where $h$ is the step size in time and $λ$ is the penalty parameter. This finding emphasizes the need for careful consideration when selecting the penalization parameter and suggests that the discretization error converges at a rate of order $\frac{“1”}{“2”}$. We validate the efficacy of the DPM through numerical tests conducted on a high-dimensional optimal stopping model in the area of American option pricing. The numerical tests confirm both the accuracy and the computational efficiency of our proposed algorithm. ...

Error Analysis of Option Pricing via Deep PDE Solvers: Empirical Study ArXiv ID: 2311.07231 “View on arXiv” Authors: Unknown Abstract Option pricing, a fundamental problem in finance, often requires solving non-linear partial differential equations (PDEs). When dealing with multi-asset options, such as rainbow options, these PDEs become high-dimensional, leading to challenges posed by the curse of dimensionality. While deep learning-based PDE solvers have recently emerged as scalable solutions to this high-dimensional problem, their empirical and quantitative accuracy remains not well-understood, hindering their real-world applicability. In this study, we aimed to offer actionable insights into the utility of Deep PDE solvers for practical option pricing implementation. Through comparative experiments, we assessed the empirical performance of these solvers in high-dimensional contexts. Our investigation identified three primary sources of errors in Deep PDE solvers: (i) errors inherent in the specifications of the target option and underlying assets, (ii) errors originating from the asset model simulation methods, and (iii) errors stemming from the neural network training. Through ablation studies, we evaluated the individual impact of each error source. Our results indicate that the Deep BSDE method (DBSDE) is superior in performance and exhibits robustness against variations in option specifications. In contrast, some other methods are overly sensitive to option specifications, such as time to expiration. We also find that the performance of these methods improves inversely proportional to the square root of batch size and the number of time steps. This observation can aid in estimating computational resources for achieving desired accuracies with Deep PDE solvers. ...