AI & ML
Learning the Brownian Motion in Machine Learning for Parametric Parabolic PDEs: A Backward Quadrature Approach
arXiv cs.NA0 views
arXiv:2611.13795v1 Announce Type: new Abstract: We propose a backward quadrature learning (BQL) method for solving high dimensional parametric semilinear parabolic partial differential equations (PDEs). To the best of our knowledge, this work is the first to extend the applicability of BSDE-based stochastic numerical methods to this class of PDEs. Specifically, inspired by the approach of learning the random variables (LRV)~\cite{BeckerJentzenMullerWurstemberger2024}, BQL incorporates learnable quadrature for Brownian increments at each time level into the backward recursion of BSDEs, enabling more efficient layerwise approximation of local conditional expectations. Furthermore, BQL introduces a continuation surrogate to facilitate the transfer of value-function information from subsequent to preceding time levels, avoiding nested quadrature while controlling the propagation of local approximation errors. Our main theoretical contribution is the derivation of a global error bound that explicitly characterizes the decomposition of the total error, together with a proof of first-order mean-square convergence under suitable approximation and integrability assumptions. Finally, numerical experiments demonstrate that BQL achieves competitive solution accuracy while substantially reducing the amortized computational cost per query. For the HJB benchmark across the tested dimensions, with $Q=7$ parameter queries, BQL achieves computational cost reductions of approximately 40-fold and 4-fold compared with P$^2$INN~[2] and FBSNN~[3], respectively.
Source:https://arxiv.org/abs/2611.13795PreviousTwo nodally bound-preserving and mass-conservative discontinuous Galerkin methods for reaction-diffusion problemsNextAccelerating matrix-free fast diagonalization and preconditioned linear solvers for higher-order finite element discretized elliptic problems on distributed GPUs
Related posts
Hitting 200 Strokes: What the Signature Maker Does at Its Stroke Limit
0dev.to
A Lightweight, Open-Source Network Digital Twin Blueprint for IoT-Edge Environments
0arXiv cs.NI
Bridge: Optimizing Collective Communication Schedules in Reconfigurable Networks with Reusable Subrings
0arXiv cs.NI
SplitCom: Communication-efficient Split Federated Fine-tuning of LLMs via Temporal Compression
0arXiv cs.NI
Programmable GPU-Accelerated dApps for Real-Time Edge Inference and ISAC on NVIDIA Aerial Testbed
0arXiv cs.NI
PSL-RGHA: Parallel Split Learning with Reference Gradient Half-Space Alignment for Mitigating Gradient Divergence
0arXiv cs.NI