From Monte Carlo to neural networks approximations of boundary value problems

From MaRDI portal
Publication:6409645

arXiv2209.01432MaRDI QIDQ6409645FDOQ6409645


Authors: Lucian Beznea, Iulian Cîmpean, Oana Lupaşcu-Stamate, Ionel Popescu, Arghir Zarnescu Edit this on Wikidata


Publication date: 3 September 2022

Abstract: In this paper we study probabilistic and neural network approximations for solutions to Poisson equation subject to H" older or C2 data in general bounded domains of mathbbRd. We aim at two fundamental goals. The first, and the most important, we show that the solution to Poisson equation can be numerically approximated in the sup-norm by Monte Carlo methods based on a slight change of the walk on spheres algorithm. This provides estimates which are efficient with respect to the prescribed approximation error and without the curse of dimensionality. In addition, the overall number of samples does not not depend on the point at which the approximation is performed. As a second goal, we show that the obtained Monte Carlo solver renders ReLU deep neural network (DNN) solutions to Poisson problem, whose sizes depend at most polynomially in the dimension d and in the desired error. In fact we show that the random DNN provides with high probability a small approximation error and low polynomial complexity in the dimension.













This page was built for publication: From Monte Carlo to neural networks approximations of boundary value problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409645)