One model to solve them all: 2BSDE families via neural operators
Takashi Furuya, Anastasis Kratsios, Dylan Possamaï, Bogdan Raonić
TL;DR
The paper addresses solving infinite families of second-order backward SDEs with random terminal time by learning a coefficient-to-solution operator for the associated fully nonlinear elliptic PDEs. It introduces a neural-operator framework based on Kolmogorov–Arnol’d networks (KANO/Res--KANs) that learns the map $(f_0,g)\mapsto u$ and, via a non-linear Feynman–Kac adapter, yields stochastic processes $(Y,Z,\Upsilon,A)$ for the entire problem family. The main contributions are (i) a general approximability guarantee ensuring the operator $\Gamma^+$ can uniformly approximate the solution map on compact PDE-perturbation sets, (ii) a feasible-rate result showing exponential-in-depth rates for a structured semi-linear PDE with polynomial resource usage in $1/\varepsilon$, and (iii) an extension to the stochastic $2$BSDE setting yielding $\varepsilon$-accurate approximations of $(Y^x,Z^x,\Upsilon^x,A^x)$ in expectation. Empirically, the approach demonstrates accurate recovery of the solution $u$ and its derivatives on periodic semi-linear and linear-quadratic benchmarks in dimension $d=5$, while ablation on sample size exposes the data requirements for stable high-dimensional performance. This work provides a scalable, operator-level method to solve parametric families of $2$BSDEs and their PDE representations, enabling efficient, single-pass learning across problem instances.
Abstract
We introduce a mild generative variant of the classical neural operator model, which leverages Kolmogorov--Arnold networks to solve infinite families of second-order backward stochastic differential equations ($2$BSDEs) on regular bounded Euclidean domains with random terminal time. Our first main result shows that the solution operator associated with a broad range of $2$BSDE families is approximable by appropriate neural operator models. We then identify a structured subclass of (infinite) families of $2$BSDEs whose neural operator approximation requires only a polynomial number of parameters in the reciprocal approximation rate, as opposed to the exponential requirement in general worst-case neural operator guarantees.
