activity
20232025
most citedUniversal approximation results for neural networks with non-polynomial activation function over non-compact domains

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing math.NAShow all

8 papers · 1 filter

math.NA2025

Multilevel Picard approximations for McKean-Vlasov stochastic differential equations with nonconstant diffusion

Ariel Neufeld, Tuan Anh Nguyen, Philipp Schmocker

We introduce multilevel Picard (MLP) approximations for McKean--Vlasov stochastic differential equations (SDEs) with nonconstant diffusion coefficient. Under standard Lipschitz ass…

math.NA2024

Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in -sense

Ariel Neufeld, Tuan Anh Nguyen

We prove that multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation are capable of approximating solutions of semilinear Kolmogor…

math.NA2024

Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs

Ariel Neufeld, Philipp Schmocker, Sizhou Wu

In this paper, we present a randomized extension of the deep splitting algorithm introduced in [Beck, Becker, Cheridito, Jentzen, and Neufeld (2021)] using random neural networks s…

math.NA2024

Rectified deep neural networks overcome the curse of dimensionality in the numerical approximation of gradient-dependent semilinear heat equations

Ariel Neufeld, Tuan Anh Nguyen

Numerical experiments indicate that deep learning algorithms overcome the curse of dimensionality when approximating solutions of semilinear PDEs. For certain linear PDEs and semil…

math.NA2023

Rectified deep neural networks overcome the curse of dimensionality when approximating solutions of McKean--Vlasov stochastic differential equations

Ariel Neufeld, Tuan Anh Nguyen

In this paper we prove that rectified deep neural networks do not suffer from the curse of dimensionality when approximating McKean--Vlasov SDEs in the sense that the number of par…

math.NA2023

Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities

Ariel Neufeld, Tuan Anh Nguyen, Sizhou Wu

Neufeld and Wu (arXiv:2310.12545) developed a multilevel Picard (MLP) algorithm which can approximately solve general semilinear parabolic PDEs with gradient-dependent nonlineariti…