Paper: arXiv 2308.07029
Authors: Jiuk Jang, Hyungbin Park
Abstract
This study develops a numerical scheme for path-dependent FBSDEs and PDEs. We introduce a Picard iteration method for solving path-dependent FBSDEs, prove its convergence to the true solution, and establish its rate of convergence. A key contribution of our approach is a novel estimator for the martingale integrand in the FBSDE, specifically designed to handle path-dependence more reliably than existing methods. We derive a concentration inequality that quantifies the statistical error of this estimator in a Monte Carlo framework. Based on these results, we investigate a supervised learning method with neural networks for solving path-dependent PDEs. The proposed algorithm is fully implementable and adaptable to a broad class of path-dependent problems.
Complexity vs Empirical Score
- Math Complexity: 9.5/10
- Empirical Rigor: 3.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper presents highly advanced mathematical concepts such as functional Itô calculus, path-dependent FBSDEs, and Picard iteration convergence proofs, reflecting high mathematical density. While the method is theoretically backed with a neural network approach and a Monte Carlo estimator, the excerpt emphasizes theoretical proofs and algorithmic descriptions over concrete backtesting, datasets, or empirical performance metrics.
Research Flowchart
flowchart TD
A["Research Goal: Develop Numerical Scheme<br>for Path-dependent FBSDEs/PDEs"] --> B{"Methodology"}
B --> C["Picard Iteration<br>for Path-dependent FBSDEs"]
B --> D["Novel Martingale Integrand<br>Estimator"]
B --> E["Monte Carlo Framework"]
C --> F["Proof of Convergence<br>and Rate"]
D --> G["Concentration Inequality<br>for Statistical Error"]
E --> H["Supervised Learning<br>with Neural Networks"]
F & G & H --> I["Key Outcomes:<br>1. Convergent Numerical Scheme<br>2. Error Quantification<br>3. Fully Implementable Algorithm"]
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 a Picard iteration scheme for path‑dependent FBSDEs together with a novel estimator for the martingale integrand, and derives convergence rates and a concentration inequality.
Source sentence
We construct a Picard iteration scheme, prove its convergence to the exact solution, and derive an explicit convergence rate.
Assumes 2
- Assumptions 2.1 and 2.3 (Lipschitz and growth conditions on coefficients and driver). model
Source sentence
Let Assumptions 2.1 and 2.3 hold.
- Assumption 3.1 (additional regularity) is not required for convergence. model
Source sentence
We highlight that Assumption 3.1 is not necessary for the convergence.
Data
- Floating‑strike lookback option benchmark synthetic unknown
Source sentence
experiments for benchmark problems, including a floating‑strike lookback option.
- Black–Scholes model with path‑dependent dividends synthetic unknown
Source sentence
Section 8 applies the proposed framework to derivative pricing under a Black–Scholes model with path‑dependent dividends.
- Duration‑dependent CEV model for European call and double‑barrier digital options synthetic unknown
Source sentence
Section 9 introduces a duration‑dependent CEV model and applies the Picard framework to European call and double‑barrier digital options.
Costs
Not applicable
Finds 1
- A concentration inequality quantifies the statistical error of the martingale‑integrand estimator in a Monte Carlo framework. theoretical
Source sentence
we establish a concentration inequality that quantifies the statistical error of the estimator in a Monte Carlo framework (Theorem 5.4).
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 5 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.