aiqbench analysis
This research applies deep learning techniques to solve stochastic partial differential equations (SPDEs), achieving accurate results in high-dimensional spaces up to 100 dimensions. The method offers a computationally efficient alternative for estimating functionals like mean and variance across complex systems such as stochastic heat equations and financial models. By leveraging neural networks to handle driving noise processes, this work bridges advanced machine learning with rigorous numerical analysis.
Deep learning based numerical approximation algorithms for stochastic partial differential equations
arXiv:2012.01194v3 Announce Type: replace-cross Abstract: In this article, we introduce a deep learning based approximation algorithm for SPDEs. Our approach employs neural networks to approximate the solutions of SPDEs along given realizations of the driving noise process. If applied to a set of simulated noise trajectories, it yields empirical distributions of SPDE solutions, from which functionals like the mean and variance can be estimated. We test the performance of the method on stochastic heat equations with additive and multiplicative noise as well as stochastic Black-Scholes equations with multiplicative noise and Zakai equations from nonlinear filtering theory. In all cases, the proposed algorithm yields accurate results with short runtimes in up to 100 space dimensions.
Abstract:In this article, we introduce a deep learning based approximation algorithm for SPDEs. Our approach employs neural networks to approximate the solutions of SPDEs along given realizations of the driving noise process. If applied to a set of simulated noise trajectories, it yields empirical distributions of SPDE solutions, from which functionals like the mean and variance can be estimated. We test the performance of the method on stochastic heat equations with additive and multiplicative noise as well as stochastic Black-Scholes equations with multiplicative noise and Zakai equations from nonlinear filtering theory. In all cases, the proposed algorithm yields accurate results with short runtimes in up to 100 space dimensions.
Numerical Analysis (math.NA); Machine Learning (cs.LG); Probability (math.PR); Machine Learning (stat.ML)
arXiv:2012.01194 [math.NA]
(or arXiv:2012.01194v3 [math.NA] for this version)
https://doi.org/10.48550/arXiv.2012.01194 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 209 words
Related coverage

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · Sep 27, 2026

Universal Dilation of Linear Itô SDEs: Quantum Trajectories and Lindblad Simulation of Second Moments
Quantum Journal · Oct 1, 2026

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026
A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems
arXiv · Jun 3, 2026