Paper: arXiv 2611.20550
Authors: Liangliang Zhang
Abstract
The analytical expansion method for BSDEs of Zhang (2017) breaks down when the terminal condition psi has kinks or discontinuities. We replace psi by psi_epsilon = psi * rho_epsilon and derive a joint error decomposition whose expansion constants explicitly track the derivative blow-up as epsilon tends to 0. For symmetric mollifiers the leading weak bias cancels. The associated balanced rates are conditional on an explicitly stated uniform local-to-global Taylor-propagation assumption: under that assumption the benchmark (l, m, alpha) = (0, 2, 1) gives epsilon* ~ delta_t^{1/3} and weak rate 2/3. Without it, the rigorous additive bound gives no decay when m - 2l = 2; an unconditional positive rate is obtained only for m - 2l > 2. Asymptotic corrections cancel the weak bias through order epsilon^{2J}; their faster exponents are formal targets unless the auxiliary expansion errors and the Picard defect satisfy additional rate conditions, which we state explicitly. For the driver-free fixed-center scheme we identify an n-independent terminal-representation error and show that it depends on the expansion center and on the terminal representative; change-of-basis invariance does not imply centering independence. A Gaussian moment-compression layer combines whitening, a Stein recursion, and knapsack truncation with a jet-conditioned error certificate. This Part I contains the theory, with all proofs self-contained; numerical evidence and implementation measurements are reported separately in the companion paper (Part II).
Complexity vs Empirical Score
- Math Complexity: 9.0/10
- Empirical Rigor: 2.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: This paper presents a highly theoretical and mathematically dense approach to solving BSDEs with non-smooth terminal conditions. While the novelty and mathematical rigor are high, the complete lack of empirical results in this ‘Part I’ significantly lowers its empirical rigor and reproducibility for immediate application.
Research Flowchart
flowchart TD
A["Research Goal: Address breakdown of analytical expansion for BSDEs with non-smooth terminal conditions"] --> B{"Key Methodology: Mollification Regularization"};
B --> C["Method: Replace non-smooth psi with smooth psi_epsilon = psi * rho_epsilon"];
C --> D["Analysis: Derive joint error decomposition tracking derivative blow-up as epsilon -> 0"];
D --> E{"Key Findings / Outcomes"};
E --> F["Finding 1: Symmetric mollifiers lead to leading weak bias cancellation. Balanced rates (l,m,alpha)=(0,2,1) yield epsilon* ~ delta_t^(1/3) and weak rate 2/3 under Taylor-propagation."];
E --> G["Finding 2: Without Taylor-propagation, rigorous additive bound shows no decay for m-2l=2; positive rate only for m-2l > 2."];
E --> H["Finding 3: Asymptotic corrections cancel weak bias through order epsilon^(2J) conditional on auxiliary error and Picard defect rates."];
E --> I["Finding 4: Driver-free fixed-center scheme has n-independent terminal-representation error depending on expansion center and terminal representative."];
E --> J["Finding 5: Gaussian moment-compression layer developed (whitening, Stein recursion, knapsack truncation with jet-conditioned error certificate)."];
B --> K["Theory Paper (Part I): All proofs self-contained"];
K --> L["Companion Paper (Part II): Numerical evidence and implementation measurements (not in scope for this flowchart)"];
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 mollification regularization framework that replaces a non‑smooth terminal condition ψ by its convolution ψ_ε = ψ * ρ_ε and provides joint error estimates separating regularization error and expansion error.
Source sentence
Contributions of This Paper The main contributions of this paper are fivefold: (1) Mollification framework with joint error estimates. We introduce a systematic mol-lification regularization approach that replaces the non-smooth terminal condition ψ by its convolution ψε = ψ ∗ρε with a standard mollifier of bandwidth ε > 0.
Assumes 4
- Uniform local‑to‑global Taylor gain (Assumption 4.8) that aggregates Taylor‑truncation defects to C ε^{-(m‑2l‑α)} δ^{(m‑2l)/2}_t with a constant uniform along the time grid, including terminal steps. other
Source sentence
Assumption 4.8 (Uniform local-to-global Taylor gain) For the parameters under consideration, the Taylor-truncation defects of the (l, m, n) expansion aggregate to Cε−(m−2l−α)δ(m−2l)/2 t , with a constant uniform along the time grid, including the terminal steps. Assumption 4.8 is standard in form for smooth data with ε-independent constants, but is not proved here with ε-dependent constants.
- The terminal condition ψ belongs to C^{0,α}(ℝ^d) with 0 < α ≤ 1. data
Source sentence
Theorem 4.9 (Conditional expansion error with ε-dependence) Let Assumptions 2.1–2.2 and 4.8 hold, let ψ ∈C0,α(Rd), 0 < α ≤1, and assume m > 2l, 0 ≤l ≤1, and ε2 ≥δt.
- Expansion orders satisfy m > 2l and 0 ≤ l ≤ 1 (or more generally l ≥ 0, m > 2l). model
Source sentence
Theorem 4.9 (Conditional expansion error with ε-dependence) Let Assumptions 2.1–2.2 and 4.8 hold, let ψ ∈C0,α(Rd), 0 < α ≤1, and assume m > 2l, 0 ≤l ≤1, and ε2 ≥δt. Proposition 4.11 (Unconditional additive propagation bound) Assume the hypotheses of Theo-rem 4.9, except Assumption 4.8, and write q = m −2l.
- Bandwidth ε satisfies ε^2 ≥ δ_t. other
Source sentence
Theorem 4.9 (Conditional expansion error with ε-dependence) Let Assumptions 2.1–2.2 and 4.8 hold, let ψ ∈C0,α(Rd), 0 < α ≤1, and assume m > 2l, 0 ≤l ≤1, and ε2 ≥δt.
Data
No dataset named in the text.
Costs
Not applicable
Finds 5
- Under the uniform local‑to‑global Taylor gain, the benchmark (l,m,α) = (0,2,1) yields the balanced bandwidth ε* ≈ δ_t^{1/3} and a weak convergence rate of 2/3. theoretical
Source sentence
The associated balanced rates are conditional on an explicitly stated uniform local-to-global Taylor-propagation assumption: under that assumption the benchmark (l, m, alpha) = (0, 2, 1) gives epsilon* ~ delta_t^{1/3} and weak rate 2/3. For (l, m, α) = (0, 2, 1) these formal values are δ1/3 t and 2/3.
- Without Assumption 4.8, the additive bound gives no decay when m‑2l = 2, and only a positive polynomial rate for Hölder data when m‑2l > 2. theoretical figure from elsewhere in the paper
Source sentence
Without it, the rigorous additive bound gives no decay when m - 2l = 2; an unconditional positive rate is obtained only for m - 2l > 2. Proposition 4.11 instead supplies an unconditional bound and a positive rate for q > 2.
- Asymptotic correction terms cancel the weak bias through order ε^{2J}, provided auxiliary expansion errors and Picard defect satisfy additional rate conditions. theoretical
Source sentence
Asymptotic corrections cancel the weak bias through order epsilon^{2J}; their faster exponents are formal targets unless the auxiliary expansion errors and the Picard defect satisfy additional rate conditions, which we state explicitly. (3) Asymptotic correction terms and sufficient rate conditions.
- For symmetric mollifiers the leading weak bias cancels, giving a regularization weak error of order O(ε^2). theoretical
Source sentence
For symmetric mollifiers the leading weak bias cancels. What improves is the regularization error: for symmetric kernels the first-order bias cancels and the weak (pointwise, t < T) bias becomes O(ε2) (Proposition B.3).
- The expansion error constants grow with dimension d through derivative order χ ≥ m + d + 2, limiting practical applicability to moderate dimensions. theoretical
Source sentence
The expansion error constants, however, depend on d through the derivative order χ ≥m + d + 2 and combinatorial multi-index factors (Remark 2.15); accordingly, the practical scope of the method is moderate dimensions, as reflected in the numerical experiments reported in Part II (Zhang, 2026b). 3.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 16 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-17 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (50)
- Essays on numerical solutions to forward-backward stochastic differential equations and their applications in finance (2017)
- Adapted solution of a backward stochastic differential equation (1990) — link
- Backward stochastic differential equations and quasilinear parabolic partial differential equations (1992) — link
- Backward-forward stochastic differential equations (1993) — link
- Forward-Backward Stochastic Differential Equations and Their Applications (1999) — link
- Backward stochastic differential equations in finance (1997) — link
- Continuous-time Stochastic Control and Optimization with Financial Applications (2009) — link
- Stochastic differential utility (1992) — link
and 42 more
- Arbitrage-free XVA (2018) — link
- A regression-based M onte C arlo method to solve backward stochastic differential equations (2005) — link
- Discrete-time approximation and M onte- C arlo simulation of backward stochastic differential equations (2004) — link
- Solving high-dimensional partial differential equations using deep learning (2018) — link
- Deep backward schemes for high-dimensional nonlinear PDE s (2020) — link
- Analytical approximation for non-linear FBSDE s with perturbation scheme (2012) — link
- An asymptotic expansion for forward-backward SDE s: a M alliavin calculus approach (2016) — link
- Analytical approximations of BSDE s with nonsmooth driver (2015) — link
- Explicit implied volatilities for multifactor local-stochastic volatility models (2017) — link
- Analytical approximation of the transition density in a local volatility model (2012) — link
- Simulation of BSDE s by W iener chaos expansion (2014) — link
- Partial Differential Equations (2010) — link
- A quantization algorithm for solving multidimensional discrete-time optimal stopping problems (2003) — link
- $L^2$ -time regularity of BSDE s with irregular terminal functions (2010) — link
- Generalized fractional smoothness and $L^p$ -variation of BSDE s with non- L ipschitz terminal condition (2012) — link
- A second-order discretization for forward-backward SDE s using local approximations with M alliavin calculus (2019) — link
- Stochastic Numerics for Mathematical Physics (2004) — link
- Branching diffusion representation for nonlinear C auchy problems and M onte C arlo approximation (2021) — link
- Neural networks-based algorithms for stochastic control and PDE s in finance (2023) — link
- A family of density expansions for L 'evy-type processes (2015) — link
- On the rate of convergence of discrete-time contingent claims (2000) — link
- Multilevel M onte C arlo path simulation (2008) — link
- A numerical scheme for BSDE s (2004) — link
- A probabilistic numerical method for fully nonlinear parabolic PDE s (2011) — link
- Error expansion for the discretization of backward stochastic differential equations (2007) — link
- Expansion of the global error for numerical schemes solving stochastic differential equations (1990) — link
- Rate of convergence of an empirical regression method for solving generalized backward stochastic differential equations (2006) — link
- Linear multistep schemes for BSDE s (2014) — link
- Runge– K utta schemes for backward stochastic differential equations (2014) — link
- Solving backward stochastic differential equations using the cubature method: application to nonlinear pricing (2012) — link
- Second order discretization of backward SDE s and simulation with the cubature method (2014) — link
- Numerical methods for backward stochastic differential equations: a survey (2023) — link
- Random walk approximation of BSDE s with H "older continuous terminal condition (2020) — link
- Smoothing the payoff for efficient computation of basket option prices (2018) — link
- Numerical smoothing with hierarchical adaptive sparse grids and quasi- M onte C arlo methods for efficient option pricing (2023) — link
- Asymptotic and non asymptotic approximations for option valuation (2013) — link
- Asymptotic expansion as prior knowledge in deep learning method for high dimensional BSDE s (2019) — link
- Analytical expansions for parabolic equations (2015) — link
- Linear regression MDP scheme for discrete backward stochastic differential equations under general conditions (2016) — link
- Approximation of backward stochastic differential equations using M alliavin weights and least-squares regression (2016) — link
- User’s guide to viscosity solutions of second order partial differential equations (1992) — link
- Weak error estimates for rough volatility models — → 2212.01591
1 of 50 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.