In this paper, we introduce two neural-network-based numerical schemes for solving systems of coupled ergodic Backward Stochastic Differential Equations (eBSDEs), motivated by the approximation of optimal strategies within the framework of forward utilities in a regime-switching stochastic factor model. Our approach builds on the representation of such models through systems of eBSDEs introduced in [HLT20].
arXiv:2609.30274v1 Announce Type: new
Abstract: Machine Learning and more specifically Deep Learning involves solving large scale nonconvex optimization problems. Several algorithms have been propose...
By St\'ephane Galatolo, St\'ephane Chr\'etien
arXiv:2607. 19173v1 Announce Type: new Abstract: Neural stochastic differential equations (SDEs) have emerged as powerful tools for learning noisy or stochastic dynamics directly from data; however, existing approaches largely assume uncoupled and continuous noise, limiting their applicability to realistic stochastic drivers, and often scale poorly in time, requiring expensive autoregressive training.
By Arthur Bizzi, Olga Fink
arXiv:2606. 28671v1 Announce Type: new Abstract: Stackelberg differential games (SDGs) provide a powerful framework for hierarchical decision-making in stochastic and continuous-time environments, yet their solution remains computationally challenging due to the complexity of traditional dynamic programming and Hamilton-Jacobi-Bellman-Isaacs (HJBI) methods, especially in high-dimensional systems.
By Congde Hu, Danping Li, Lin Xu, Wenying Xu
arXiv:2412. 03405v3 Announce Type: replace-cross Abstract: Motivated by dynamic risk measures and conditional $g$-expectations, in this work we propose a numerical method to approximate the solution operator given by a Backward Stochastic Differential Equation (BSDE).
By Pere Diaz-Lozano, Giulia Di Nunno
arXiv:2406. 14340v2 Announce Type: replace-cross Abstract: The standard stochastic gradient descent (SGD) optimization method, as well as adaptive methods such as the Adam optimizer fail to converge if the learning rates do not converge to zero (particularly, in the situation of constant learning rates).
By Steffen Dereich, Arnulf Jentzen, Adrian Riekert
arXiv:2606. 24999v1 Announce Type: new Abstract: High-dimensional partial differential equations (PDEs) with unknown coefficients arise widely in scientific machine learning, including continuous-time reinforcement learning, yet solving them efficiently in a data-driven way remains challenging.
By Yanwei Jia, Du Ouyang, Huy\^en Pham, Xun Yu Zhou
arXiv:2606. 29474v1 Announce Type: cross Abstract: This paper develops an a posteriori error analysis framework for decoupled neural approximations of fully coupled forward--backward stochastic differential equations (FBSDEs).
By Xichuan Zhang
Neural PDE solvers provide efficient surrogates for time-dependent physical systems, but autoregressive prediction over long horizons remains challenging because local errors can induce distribution s...
arXiv:2603. 18907v2 Announce Type: replace Abstract: We propose a new Neural Galerkin Normalizing Flow framework to approximate the transition probability density function of a diffusion process by solving the corresponding Fokker-Planck equation with an atomic initial distribution, parametrically with respect to the location of the initial mass.
By Riccardo Saporiti, Fabio Nobile
arXiv:2604. 06001v2 Announce Type: replace-cross Abstract: Efficiently solving the Fokker-Planck equation (FPE) is central to analyzing complex parameterized stochastic systems.
By Xiaolong Wang, Jing Feng, Qi Liu, Chengli Tan, Yuanyuan Liu, Yong Xu
The paper introduces a mesh‑free, self‑supervised neural operator—called the Normalizing Flow Invertible Solution Transformer (NFIST)—for stochastic mean‑field control (MFC). By reformulating the controlled Fokker–Planck dynamics as a deterministic continuity equation via a probability‑flow ODE and an invertible normalizing‑flow transformer, the authors enable closed‑form score evaluation with linear cost per particle. The resulting operator learns from task prompts (distribution parameters or particle clouds) and can solve unseen MFC tasks in a single forward pass, achieving zero‑shot generalization across applications such as stochastic optimal control, Schrödinger bridges, systemic‑risk control, and obstacle‑avoiding path planning.
By Suyi Gao, Mo Zhou, Rongjie Lai