An analysis of the derivative-free loss method for solving PDEs
Jihun Han, Yoonsang Lee
TL;DR
This work analyzes the derivative-free loss method (DFLM) for solving elliptic PDEs and fluid problems through a Feynman–Kac representation with stochastic walkers. It derives a bias bound for the empirical martingale loss that scales as $\Delta t / N_s$ and proves a problem-dependent lower bound $\Delta t^*$ necessary for effective learning, highlighting a trade-off between neighborhood exploration and estimator bias. The authors validate the theory with numerical experiments on a Poisson problem and the Taylor–Green vortex, demonstrating how to choose $\Delta t$ and $N_s$ to balance accuracy and computational cost. The findings offer practical guidance for deploying DFLM in high-dimensional PDEs and motivate extensions to multiscale settings with adaptive time-stepping strategies.
Abstract
This study analyzes the derivative-free loss method to solve a certain class of elliptic PDEs and fluid problems using neural networks. The approach leverages the Feynman-Kac formulation, incorporating stochastic walkers and their averaged values. We investigate how the time interval associated with the Feynman-Kac representation and the walker size influence computational efficiency, trainability, and sampling errors. Our analysis shows that the training loss bias scales proportionally with the time interval and the spatial gradient of the neural network, while being inversely proportional to the walker size. Moreover, we demonstrate that the time interval must be sufficiently long to enable effective training. These results indicate that the walker size can be chosen as small as possible, provided it satisfies the optimal lower bound determined by the time interval. Finally, we present numerical experiments that support our theoretical findings.
