Multilevel Picard approximations for McKean-Vlasov stochastic differential equations

03/19/2021
by   Martin Hutzenthaler, et al.
0

In the literatur there exist approximation methods for McKean-Vlasov stochastic differential equations which have a computational effort of order 3. In this article we introduce full-history recursive multilevel Picard (MLP) approximations for McKean-Vlasov stochastic differential equations. We prove that these MLP approximations have computational effort of order 2+ which is essentially optimal in high dimensions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/03/2021

Full history recursive multilevel Picard approximations for ordinary differential equations with expectations

We consider ordinary differential equations (ODEs) which involve expecta...
04/18/2022

Multilevel Picard approximations for high-dimensional decoupled forward-backward stochastic differential equations

Backward stochastic differential equations (BSDEs) appear in numeruous a...
05/17/2021

Adaptive Density Tracking by Quadrature for Stochastic Differential Equations

Density tracking by quadrature (DTQ) is a numerical procedure for comput...
06/28/2020

A Multilevel Approach to Training

We propose a novel training method based on nonlinear multilevel minimiz...
04/12/2018

Multilevel Particle Filters for Lévy-driven stochastic differential equations

We develop algorithms for computing expectations of the laws of models a...
06/16/2020

Deterministic Inference of Neural Stochastic Differential Equations

Model noise is known to have detrimental effects on neural networks, suc...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.