Error Analysis of Deep PDE Solvers for Option Pricing

ArXiv ID: 2505.05121 “View on arXiv”

Authors: Jasper Rou

Abstract

Option pricing often requires solving partial differential equations (PDEs). Although deep learning-based PDE solvers have recently emerged as quick solutions to this problem, their empirical and quantitative accuracy remain not well understood, hindering their real-world applicability. In this research, our aim is to offer actionable insights into the utility of deep PDE solvers for practical option pricing implementation. Through comparative experiments in both the Black–Scholes and the Heston model, we assess the empirical performance of two neural network algorithms to solve PDEs: the Deep Galerkin Method and the Time Deep Gradient Flow method (TDGF). We determine their empirical convergence rates and training time as functions of (i) the number of sampling stages, (ii) the number of samples, (iii) the number of layers, and (iv) the number of nodes per layer. For the TDGF, we also consider the order of the discretization scheme and the number of time steps.

Keywords: deep learning PDE solvers, Deep Galerkin Method, Heston model, option pricing, convergence rates, Derivatives

Complexity vs Empirical Score

• Math Complexity: 7.0/10
• Empirical Rigor: 6.5/10
• Quadrant: Holy Grail
• Why: The paper employs advanced mathematical concepts such as PDE discretization, Sobolev spaces, and deep learning optimizers, but lacks code/datasets for immediate backtesting; the experimental design is systematic and data-driven, focusing on empirical error analysis for practical implementation.

  flowchart TD
    A["Research Goal<br>Assess accuracy & utility of<br>deep PDE solvers for option pricing"] --> B{"Methodology"}
    B --> C["Comparative Experiments<br>Black-Scholes & Heston Models"]
    B --> D["Algorithms Evaluated<br>Deep Galerkin Method<br>Time Deep Gradient Flow TDGF"]
    B --> E["Input Parameters Varied<br>Sampling stages, Samples, Layers, Nodes<br>TDGF: Discretization order, Time steps"]
    C --> F["Computational Process<br>Simulation & Training<br>Convergence Rate & Time Analysis"]
    D --> F
    E --> F
    F --> G["Key Findings & Outcomes<br>Empirical Convergence Rates<br>Training Time vs. Complexity<br>Actionable Insights for Implementation"]