Overcoming the curse of dimensionality in the numerical approximation of Allen-Cahn partial differential equations via truncated full-history recursive multilevel Picard approximations | Tomesphere
arXiv:1907.06729·math.NA·March 9, 2021
Overcoming the curse of dimensionality in the numerical approximation of Allen-Cahn partial differential equations via truncated full-history recursive multilevel Picard approximations
Christian Beck, Fabian Hornung, Martin Hutzenthaler, Arnulf Jentzen,, and Thomas Kruse
This paper presents a novel recursive multilevel Picard method that effectively addresses the curse of dimensionality in high-dimensional Allen-Cahn PDEs, enabling more efficient numerical solutions for complex reaction-diffusion equations.
Contribution
The authors develop and analyze truncated full-history recursive multilevel Picard schemes to overcome computational challenges in high-dimensional nonlinear PDEs like Allen-Cahn equations.
Findings
01
Successfully reduces computational complexity in high dimensions
02
Demonstrates convergence of the proposed schemes
03
Applicable to reaction-diffusion PDEs with Lipschitz nonlinearities
Abstract
One of the most challenging problems in applied mathematics is the approximate solution of nonlinear partial differential equations (PDEs) in high dimensions. Standard deterministic approximation methods like finite differences or finite elements suffer from the curse of dimensionality in the sense that the computational effort grows exponentially in the dimension. In this work we overcome this difficulty in the case of reaction-diffusion type PDEs with a locally Lipschitz continuous coervice nonlinearity (such as Allen-Cahn PDEs) by introducing and analyzing truncated variants of the recently introduced full-history recursive multilevel Picard approximation schemes.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Overcoming the curse of dimensionality
in the numerical approximation of
Allen–Cahn partial differential equations
via truncated full-history recursive
multilevel Picard approximations
Christian Beck1,
Fabian Hornung2,3,
Martin Hutzenthaler4,
One of the most challenging problems in applied mathematics is the approximate solution of nonlinear partial differential equations (PDEs) in high dimensions. Standard deterministic approximation methods like finite differences or finite elements suffer from the curse of dimensionality in the sense that the computational effort grows exponentially in the dimension.
In this work we overcome this difficulty in the case of reaction-diffusion type PDEs with a locally Lipschitz continuous coervice nonlinearity (such as Allen–Cahn PDEs) by introducing and analyzing truncated variants of the recently introduced full-history recursive multilevel Picard approximation schemes.
One of the most challenging problems in applied mathematics is the approximate solution of nonlinear partial differential equations (PDEs) in high dimensions. Standard deterministic approximation methods like finite differences or finite elements suffer from the curse of dimensionality in the sense that the computational effort grows exponentially in the dimension. Linear parabolic PDEs of second order can be solved approximately without the curse of dimensionality by means of Monte Carlo averages. In the last few years, several probabilistic approximation methods, which seem in certain situations to be capable of efficiently approximating high-dimensional nonlinear PDEs, have been proposed. For instance, the articles [6, 18, 20, 21] propose and study approximation methods based on stochastic representations of solutions of PDEs by means of branching diffusion processes (cf., for example, [32, 35, 37] for theoretical relations and cf., for example, [36] for a related method),
the articles [1, 2, 3, 4, 5, 8, 9, 12, 13, 14, 15, 16, 17, 19, 22, 27, 29, 30, 31, 33, 34] propose and study approximation methods based on the reformulation of PDEs as stochastic learning problems involving deep artificial neural networks, and the articles [10, 11, 23, 24, 25, 26] propose and study full-history recursive multilevel Picard (MLP) approximation methods. In particular, the articles [24, 25] prove that MLP approximation schemes do indeed overcome the curse of dimensionality in the numerical approximation of semilinear parabolic PDEs. More formally, Theorem 3.8 in [24] shows that MLP approximation schemes are able to approximate the solutions of semilinear parabolic PDEs with a root mean square error of size ε∈(0,∞) and a computational effort which grows at most polynomially both in the dimension as well as in the reciprocal \nicefrac1ε of the desired approximation accuracy. However, the articles [24, 25] are only applicable in the case where the nonlinearity is globally Lipschitz continuous and, to the best of our knowledge, there exists no result in the scientific literature which shows for every T∈(0,∞) that the solution of a semilinear parabolic PDE with a non-globally Lipschitz continuous nonlinearity can be efficiently approximated at time T without the curse of dimensionality.
In this work we overcome this difficulty by introducing a truncated variant of the MLP approximation schemes introduced in [10, 24] and by proving that this truncated MLP approximation scheme succeeds in approximately solving reaction-diffusion type PDEs with a locally Lipschitz continuous coercive nonlinearity (such as Allen–Cahn type PDEs) without the curse of dimensionality.
More specifically, Theorem 4.5 in Section 3 below, which is the main result of this article, proves under suitable assumptions that for every δ∈(0,∞), ε∈(0,1] it holds that the proposed truncated MLP approximations can achieve a root mean square error of size at most ε with a computational effort of order dε−(2+δ). To illustrate the findings of this article in more detail, we now present in Theorem 1.1 below a special case of Theorem 4.5.
Theorem 1.1**.**
Let
δ,κ,T∈(0,∞),
Θ=∪n∈NZn,
f∈C1(R,R),
(fd)d∈N⊆C(R,R),
(ud)d∈N⊆C([0,T]×Rd,R),
assume that
f′
is at most polynomially growing,
assume for every
d∈N,
t∈(0,T],
x∈Rd,
v∈R
that
vf(v)≤κ(1+v2),
∣ud(0,x)∣≤κ,
ud∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
infc∈R(sups∈[0,T]supy=(y1,…,yd)∈Rd(ec(∣y1∣2+…+∣yd∣2)∣ud(s,y)∣))<∞,
fd(v)=f(min{ln(1+ln(d)),max{−ln(1+ln(d)),v}}),
and
[TABLE]
let
(Ω,F,P)
be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wd,θ:[0,T]×Ω→Rd,
d∈N,
θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ
and
(Wd,θ)(d,θ)∈N×Θ
are independent,
let
Rθ:[0,T]×Ω→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Rtθ=tRθ,
for every
d∈N,
s∈[0,T],
t∈[s,T],
x∈Rd,
θ∈Θ
let
Xs,t,xd,θ:Ω→Rd
satisfy
Xs,t,xd,θ=x+2(Wtd,θ−Wsd,θ),
let
Un,Md,θ:[0,T]×Rd×Ω→R,
d,M∈N,
θ∈Θ, n∈N0,
satisfy for every
d,n,M∈N,
θ∈Θ,
t∈[0,T],
x∈Rd
that
U0,Md,θ(t,x)=0
and
[TABLE]
and for every
d,M∈N,
n∈N0
let
Cd,n,M∈N0
be the number of realizations of scalar standard normal random variables which are used to compute one realization of
Un,Md,0(T,0):Ω→R
(cf. 5.2 for a precise definition).
Then there exist
N:(0,1]→N
and
c∈R
such that for every
d∈N,
ε∈(0,1]
it holds that
Cd,Nε,Nε≤cdε−(2+δ)
and
[TABLE]
Theorem 1.1 above is an immediate consequence of 5.2 in Section 5 below. 5.2 follows from 5.1 which, in turn, is deduced from Theorem 4.5, the main result of this article.
Theorem 1.1 establishes under suitable assumptions that for every
δ∈(0,∞)
there exists
c∈(0,∞)
such that for every d∈N the solution ud:[0,T]×Rd→R of the reaction-diffusion type partial differential equation in (1) can be approximated by the MLP approximation scheme in (2) with a root mean square error of size ε∈(0,∞) while the computational effort is bounded by cdε−(2+δ). The numbers Cd,n,M, d,M∈N, n∈N0, in Theorem 1.1 model the computational effort. The nonlinearity f:R→R in Theorem 1.1 is required to be locally Lipschitz continuous (which follows from the hypothesis in Theorem 1.1 that f′ is continuous) and to satisfy a coercivity type condition in the sense that there exists κ∈R such that for all v∈R it holds that vf(v)≤κ(1+v2).
This coercivity type condition together with the growth assumption on the solutions ud:[0,T]×Rd→R, d∈N, allows us to deduce in
Section 2 that the solutions ud:[0,T]×Rd→R, d∈N, are uniformly bounded.
In particular, 2.4 in Section 2 yields that
there exists M∈N such that for every M∈[M,∞)∩N,
d∈N,
t∈[0,T],
x∈Rd
it holds that
(∂t∂ud)(t,x)=(Δxud)(t,x)+fM(ud(t,x)).
The fact that for every d,M∈N it holds that (∂t∂ud)(t,x)=(Δxud)(t,x)+fM(ud(t,x)), (t,x)∈[0,T]×Rd, is a parabolic PDE with a globally Lipschitz continuous
nonlinearity then permits us to bring the machinery from [24] into play. This will finally allow us to prove Theorem 1.1 (see Sections 2 and 3 for details). We note that although Theorem 1.1 uses the assumption that the nonlinearity f:R→R satisfies the coercivity type condition that there exists κ∈R such that for all
v∈R
it holds that
vf(v)≤κ(1+v2),
explicit knowledge of the coercivity constant κ is not required for the implementation of the MLP approximation scheme.
The remainder of this article is organized as follows. In Section 2 we present elementary a priori bounds for classical solutions of reaction-diffusion type PDEs with coercive nonlinearities.
In Section 3 we introduce truncated MLP approximation schemes and we provide upper bounds for the root mean square distance between the truncated MLP approximations and the exact solution of the PDE under consideration. In Section 4 we combine the error estimates from Section 3 with estimates for the computational effort for truncated MLP approximations to show under suitable assumptions that for every δ∈(0,∞) a root mean square error of size ε∈(0,1] can be achieved by truncated MLP approximations with a computational effort of order dε−(2+δ). In Section 5 we specialize our findings to Allen–Cahn type PDEs.
2 A priori bounds for reaction-diffusion equations with coercive nonlinearity
For convenience of the reader, we recall the following well-known maximum principle for subsolutions of the heat equation (cf., e.g., John [28, Pages 216–217 in Section 1 in Chapter 7]).
Lemma 2.1**.**
Let d∈N, T∈(0,∞), v∈C([0,T]×Rd,R), assume that v∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
assume for every t∈(0,T],x∈Rd that
[TABLE]
let ∥⋅∥:Rd→[0,∞) be the d-dimensional Euclidean norm,
and assume that
let Φε:[0,T]×Rd→R,ε∈(0,∞), be the functions which satisfy for every ε∈(0,∞),t∈[0,T], x∈Rd that
[TABLE]
and let wε,M:[0,T]×Rd→R,ε,M∈(0,∞),
be the functions which satisfy for every ε,M∈(0,∞),t∈[0,T], x∈Rd that
[TABLE]
Observe that for every
ε∈(0,∞),
t∈[0,T],
x∈Rd
it holds that
[TABLE]
This implies that for every ε∈(0,∞), t∈[0,T], x=(x1,…,xd)∈Rd it holds that
[TABLE]
Therefore, we obtain that for every ε∈(0,∞), t∈[0,T], x=(x1,…,xd)∈Rd it holds that
[TABLE]
Moreover, observe that for every ε∈(0,∞), t∈[0,T], x∈Rd it holds
that
[TABLE]
Combining this with (12) ensures that for every ε∈(0,∞), t∈[0,T], x∈Rd it holds that
[TABLE]
This, (4), and (9)
imply that for every ε,M∈(0,∞), t∈(0,T], x∈Rd it holds that
[TABLE]
In addition, observe that (5) ensures that there exist C∈[0,∞) and a∈(0,∞) such that for every t∈[0,T],x∈Rd it holds that
[TABLE]
To prove (6) we distinguish
between the case T<4a1 and the case T≥4a1.
We first prove (6) in the
case T<4a1.
Observe that (8), (9) and (16) imply that for every ε∈(0,4a1−T), M∈(0,∞),t∈[0,T],x∈Rd it holds that
[TABLE]
Furthermore, observe that the hypothesis that v∈C([0,T]×Rd,R) and the fact that the interval [0,T] is compact ensure that infs∈[0,T]v(s,0)∈R. Hence, we obtain that for every ε,M∈(0,∞) it holds that
[TABLE]
This and the fact that for every ε∈(0,4a1−T) it holds that a<4(T+ε)1 imply that
there exists a function R=(Rε,M)(ε,M)∈(0,∞)2:(0,∞)2→(0,∞) such that for every ε∈(0,4a1−T), M∈(0,∞) it holds that
[TABLE]
Combining this with (8) and (9)
proves that for every ε∈(0,4a1−T), M∈(0,∞),t∈[0,T] it holds that
[TABLE]
This, (17), and (19) ensure that for every ε∈(0,4a1−T), M∈(0,∞),t∈[0,T],x∈Rd with ∥x∥>Rε,M it holds that
[TABLE]
Therefore, we obtain that for every ε∈(0,4a1−T),
M∈(0,∞) it holds that
[TABLE]
The fact that for every ε∈(0,4a1−T),
M∈(0,∞) it holds that the
function wε,M:[0,T]×Rd→R is continuous hence
demonstrates that for every ε∈(0,4a1−T), M∈(0,∞)
there exists (tε,M,xε,M)∈[0,T]×Rd such that it holds that
[TABLE]
The fact that for every ε∈(0,4a1−T), M∈(0,∞) it holds that wε,M∣(0,T]×Rd∈C1,2((0,T]×Rd,R) therefore ensures that for every ε∈(0,4a1−T), M∈(0,∞),v∈Rd with
tε,M>0 it holds that
[TABLE]
Hence, we obtain that for every ε∈(0,4a1−T), M∈(0,∞) with tε,M>0 it holds that
[TABLE]
and
[TABLE]
This and (15) imply that for every
ε∈(0,4a1−T), M∈(0,∞) with
tε,M>0 it holds that
[TABLE]
Hence, we obtain for every ε∈(0,4a1−T), M∈(0,∞) that tε,M=0.
Combining this with (23) proves that
for every ε∈(0,4a1−T), M∈(0,∞) it holds
that
[TABLE]
This and (9) imply that for every t∈[0,T], x∈Rd,
ε∈(0,4a1−T), M∈(0,∞) it holds that
[TABLE]
Therefore, we obtain that for every t∈[0,T], x∈Rd, ε∈(0,4a1−T) it holds
that
[TABLE]
Hence, we obtain that for every t∈[0,T], x∈Rd it holds that
[TABLE]
This establishes (6)
in the case T<4a1.
We now prove
(6) in the case T≥4a1.
For this let k∈N and T∈(0,8a1] be the real numbers which satisfy that
[TABLE]
let τl∈R,l∈{0,1,…,k+1}, be the real numbers which satisfy for all l∈{0,1,…,k} that
[TABLE]
and let vl:[0,τl+1−τl]×Rd→R,l∈{0,1,…,k}, be the functions which satisfy for all l∈{0,1,…,k},t∈[0,τl+1−τl],x∈Rd that
[TABLE]
Next we claim that for every l∈{0,1,…,k+1} it holds that
[TABLE]
We now prove (35) by induction on l∈{0,1,…,k+1}. Observe that the fact that
[TABLE]
establishes (35) in the base case l=0.
For the induction step {0,1,…,k}∋l→l+1∈{1,2,…,k+1} assume that there exists l∈{0,1,…,k} such that
[TABLE]
In addition, note that (4),
(16),
and
(34)
ensure that for every t∈(0,τl+1−τl],x∈Rd it holds that
Let
d∈N,
T∈(0,∞),
c∈R,
let
∥⋅∥:Rd→[0,∞)
be a norm,
let
f:[0,T]×Rd×R→R
be a function which satisfies for every
t∈[0,T],
x∈Rd,
y∈R
that
yf(t,x,y)≤c(1+y2),
and let
u∈C([0,T]×Rd,R)
satisfy for every
t∈[0,T),
x∈Rd that
u∣[0,T)×Rd∈C1,2([0,T)×Rd,R),
infa∈Rsup(s,y)∈[0,T]×Rd(ea∥y∥2∣u(s,y)∣)<∞,
and
Throughout this proof let
U:[0,T]×Rd→R
and
F:[0,T]×Rd×R→R
be the functions which satisfy for every
t∈[0,T],
x∈Rd,
y∈R
that
U(t,x)=u(T−t,2x) and F(t,x,y)=f(T−t,2x,y).
Observe that the assumption that for every
t∈[0,T],
x∈Rd,
y∈R
it holds that
vf(t,x,y)≤c(1+y2) implies for every
t∈[0,T],
x∈Rd,
y∈R
that
[TABLE]
Moreover, observe that the hypothesis that
infa∈Rsup(s,y)∈[0,T]×Rd(ea∥y∥2∣u(s,y)∣)<∞
ensures that there exists
α∈R
which satisfies that
[TABLE]
This implies that
[TABLE]
Hence, we obtain that
[TABLE]
In addition, note that the hypothesis that
u∈C([0,T]×Rd,R),
the hypothesis that
u∣[0,T)×Rd∈C1,2([0,T)×Rd,R),
the chain rule, and (68) ensure that for every
t∈(0,T],
x∈Rd
it holds that
U∈C([0,T]×Rd,R),
that
U∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
and that
[TABLE]
Combining this,
(70), and
(73) with Theorem 2.3
(with f=F, u=U in the notation of Theorem 2.3)
demonstrates for every
t∈[0,T]
that
In this section we present and analyze a (truncated) MLP approximation scheme for reaction-diffusion type PDEs with coercive nonlinearity (see 3.1
below for details). The error analysis relies on results in [24, Section 3] (cf. also 3.4 below) in combination with a Feynman–Kac representation (cf. Lemma 3.3) and the a priori estimates in Section 2
above.
Setting 3.1** (Setting and algorithm).**
Let
d∈N,
T∈(0,∞),
Θ=∪n∈NZn,
f∈C([0,T]×Rd×R,R),
g∈C(Rd,R),
let
fr:[0,T]×Rd×R→R, r∈(0,∞),
satisfy for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
u∈R
that
[TABLE]
let
(Ω,F,P) be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wθ:[0,T]×Ω→Rd, θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ and (Wθ)θ∈Θ are independent,
let
Rθ:[0,T]×Ω→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Rtθ=t+(T−t)Rθ,
for every
θ∈Θ,
t∈[0,T],
s∈[t,T],
x∈Rd
let
Xt,s,xθ:Ω→Rd
satisfy
Xt,s,xθ=x+Wsθ−Wtθ,
and let
Un,M,rθ:[0,T]×Rd×Ω→R,
θ∈Θ,
n∈N0,
M∈N,
r∈(0,∞),
satisfy for every
θ∈Θ,
n,M∈N,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
U0,M,rθ(t,x)=0
and
[TABLE]
The next result, Lemma 3.2 below, is an adaptation of [24, Theorem 3.5] to 3.1.
Lemma 3.2** (Convergence rate for stochastic fixed point equations).**
Assume
3.1,
let
ρ∈(0,∞),
let
L:(0,∞)→[0,∞)
satisfy for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
v,w∈[−r,r]
that
[TABLE]
let
u∈C([0,T]×Rd,R)
satisfy for every
r∈[ρ,∞),
t∈[0,T],
x∈Rd
that
[TABLE]
[TABLE]
Then it holds for every
n∈N0,
M∈N,
r∈[ρ,∞),
x∈Rd
that
Throughout this proof let
Pr:R→R, r∈(0,∞),
be the functions which satisfy for every
v∈R
that
Pr(v)=min{r,max{−r,v}}
and assume w.l.o.g. that there exists a standard Brownian motion
W:[0,T]×Ω→Rd
which satisfies that
(Rθ)θ∈Θ,
(Wθ)θ∈Θ,
and
W
are independent. Observe that for every
r∈(0,∞)
it holds that Pr:R→R is the projection onto the
closed convex interval [−r,r]. Therefore, we obtain for every
r∈(0,∞),
v,w∈R
that
[TABLE]
(cf., e.g., Brézis [7, Proposition 5.3]).
This, (76), and (78) imply for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
v,w∈R
that
[TABLE]
This and [24, Theorem 3.5] (with
d=d,
T=T,
L=L(r),
ξ=x,
F=(C([0,T]×Rd,R)∋v↦([0,T]×Rd∋(t,x)↦fr(t,x,v(t,x))∈R)∈C([0,T]×Rd,R)),
(Ω,F,P)=(Ω,F,P),
g=g,
u=u,
Θ=Θ,
Wθ=Wθ,
rθ=Rθ,
Rθ=Rθ,
Un,Mθ=Un,M,rθ
for
θ∈Θ,
n∈N0,
M∈N in the notation of [24, Theorem 3.5]) ensure for every
n,M∈N,
r∈[ρ,∞),
x∈Rd
that
[TABLE]
Moreover, note that (83) and [24, Lemma 3.4]
(with
d=d,
T=T,
L=L(r),
ξ=x,
F=(C([0,T]×Rd,R)∋v↦([0,T]×Rd∋(t,x)↦fr(t,x,v(t,x))∈R)∈C([0,T]×Rd,R)),
(Ω,F,P)=(Ω,F,P),
g=g,
u=u,
Θ=Θ,
Wθ=Wθ,
rθ=Rθ,
Rθ=Rθ,
Un,Mθ=Un,M,rθ
for
θ∈Θ,
n∈N0,
M∈N in the notation of [24, Lemma 3.4]) yield that for every
M∈N,
r∈[ρ,∞),
x∈Rd
it holds that
[TABLE]
Combining this with (84) establishes
(81).
The proof of Lemma 3.2 is thus completed.
∎
Lemma 3.3** (Feyman–Kac formula).**
Let
d∈N,
T∈(0,∞),
u,h∈C([0,T]×Rd,R),
let
(Ω,F,P) be a probability space,
let
W:[0,T]×Ω→Rd
be a standard Brownian motion,
for every
t∈[0,T],
s∈[t,T],
x∈Rd
let
Xt,s,x:Ω→Rd
satisfy
Xt,s,x=x+Ws−Wt,
and assume for every
t∈[0,T),
x∈Rd
that
sups∈[0,T],y∈Rd∣u(s,y)∣<∞,
E[∫tT∣h(s,Xt,s,x)∣ds]<∞,
u∣[0,T)×Rd∈C1,2([0,T)×Rd,R),
and
Throughout this proof let
⟨⋅,⋅⟩:Rd×Rd→R
be the Euclidean scalar product on Rd,
let
∥⋅∥:Rd→[0,∞)
be the Euclidean norm on Rd,
and for every
r∈(0,∞),
t∈[0,T],
x∈Rd
with
t<T−\nicefrac1r
let the function
τrt,x:Ω→[t,T−\nicefrac1r]
satisfy that
τrt,x=inf({s∈[t,T]:∥Xt,s,x−x∥>r}∪{T−\nicefrac1r}).
Observe that Itô’s formula and the hypothesis that u∣[0,T)×Rd∈C1,2([0,T)×Rd,R) ensure that for every
r∈(0,∞),
t∈[0,T],
x∈Rd
with
t<T−\nicefrac1r
it holds P-a.s. that
[TABLE]
This implies for every
r∈(0,∞),
t∈[0,T],
x∈Rd
with
t<T−\nicefrac1r
that
[TABLE]
Combining the fact that for every
t∈[0,T],
x∈Rd
it holds P-a.s. that
limsupr→∞∣τrt,x−T∣=0
and the hypothesis that
u:[0,T]×Rd→R
is a bounded continuous function with Lebesgue’s dominated convergence theorem hence implies that for every
t∈[0,T],
x∈Rd
it holds that
[TABLE]
In addition, note that the fact that for every
t∈[0,T],
x∈Rd
it holds P-a.s. that
limsupr→∞∣τrt,x,t−t∣=0,
the hypothesis that
h:[0,T]×Rd→R
is a continuous function,
the hypothesis that for every
t∈[0,T],
x∈Rd
it holds that
∫tTE[∣h(s,Xt,s,x)∣]ds<∞,
and Lebesgue’s dominated convergence theorem ensure for every
t∈[0,T],
x∈Rd
that
[TABLE]
This, (89), and (90) imply for every
t∈[0,T),
x∈Rd
that
[TABLE]
This establishes (87). The proof of Lemma 3.3 is thus completed.
∎
Proposition 3.4** (Convergence rate for Allen–Cahn PDEs).**
Assume
Setting 3.1,
let
ρ∈(0,∞),
c∈[0,∞),
let
∥⋅∥:Rd→[0,∞)
be a norm,
let
L:(0,∞)→[0,∞)
satisfy for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
v,w∈[−r,r]
that
[TABLE]
let
u∈C([0,T]×Rd,R)
satisfy that
infa∈R[supt∈[0,T]supx∈Rd(ea∥x∥2∣u(t,x)∣)]<∞
and
u∣[0,T)×Rd∈C1,2([0,T)×Rd,R),
and assume for every
t∈[0,T),
x∈Rd,
v∈R
that
ρ≥ecT(1+∣g(x)∣2)\nicefrac12,
vf(t,x,v)≤c(1+v2), ∫tTE[∣f(s,Xt,s,x0,0)∣]ds<∞,
u(T,x)=g(x),
and
[TABLE]
Then it holds for every
n∈N0,
M∈N,
r∈[ρ,∞),
x∈Rd
that
First, observe that the hypothesis that supx∈Rd∣g(x)∣<∞
implies that for every
x∈Rd
it holds that
[TABLE]
Next note that 2.4 (with d=d, T=T, c=c, ∥⋅∥=∥⋅∥, f=f, u=u in the notation of 2.4) ensures for every
t∈[0,T]
that
[TABLE]
Combining this with (76) yields for every
r∈[ρ,∞),
t∈[0,T],
x∈Rd
that
[TABLE]
This and (94) demonstrate that for every
r∈[ρ,∞),
t∈[0,T),
x∈Rd
it holds that
[TABLE]
Next observe that the fact that supt∈[0,T],x∈Rd∣u(t,x)∣≤ρ and (93) ensure that for every
r∈[ρ,∞),
t∈[0,T],
x∈Rd
it holds that
(E[∣u(s,X0,s,x0)∣2])\nicefrac12≤ρ<∞
and
[TABLE]
Hence, we obtain that (99) and Lemma 3.3 (with
d=d,
T=T,
u=u,
h=([0,T]×Rd∋(t,x)↦fr(t,x,u(t,x))∈R),
(Ω,F,P)=(Ω,F,P),
W=W0,
Xt,s,x=Xt,s,x0
for
t∈[0,T],
s∈[t,T],
x∈Rd
in the notation of Lemma 3.3) demonstrate that for every
r∈[ρ,∞),
t∈[0,T],
x∈Rd
it holds that
[TABLE]
Lemma 3.2 (with
ρ=ρ,
L=L,
u=u
in the notation of Lemma 3.2), (96), and (100)
hence establish (95).
The proof of 3.4 is thus completed.
∎
Proposition 3.5**.**
Let
d∈N,
ρ,T∈(0,∞),
c∈[0,∞),
Θ=∪n∈NZn,
f∈C([0,T]×Rd×R,R),
(fr)r∈(0,∞)⊆C([0,T]×Rd×R,R),
u∈C([0,T]×Rd,R),
let
∥⋅∥:Rd→[0,∞)
be a norm on Rd,
let
L:(0,∞)→[0,∞)
be a function,
let
(Ω,F,P)
be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wθ:[0,T]×Ω→Rd, θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ
and
(Wθ)θ∈Θ
are independent,
let
Rθ:[0,T]×Ω→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Rtθ=tRθ,
for every
θ∈Θ, s∈[0,T],
t∈[s,T],
x∈Rd
let
Xs,t,xθ:Ω→Rd
satisfy
Xs,t,xθ=x+2(Wtθ−Wsθ),
assume for every
r∈(0,∞),
t∈(0,T],
x∈Rd,
v∈R,
w,w∈[−r,r]
that
vf(t,x,v)≤c(1+v2),
∣f(t,x,w)−f(t,x,w)∣≤L(r)∣w−w∣,
∫0tE[∣f(s,Xs,t,x0,0)∣]ds<∞,
fr(t,x,v)=f(t,x,min{r,max{−r,v}}),
ecT(1+∣u(0,x)∣2)\nicefrac12≤ρ,
u∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
infa∈R[sups∈[0,T]supy∈Rd(ea∥y∥2∣u(s,y)∣)]<∞,
and
[TABLE]
and let
Un,M,rθ:[0,T]×Rd×Ω→R,
θ∈Θ,
n∈N0,
M∈N,
r∈(0,∞),
satisfy for every
θ∈Θ, n,M∈N,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
U0,M,rθ(t,x)=0
and
[TABLE]
Then it holds for every
n∈N0,
M∈N,
r∈[ρ,∞),
x∈Rd
that
Throughout this proof let
v:[0,T]×Rd→R
be the function which satisfies for every
t∈[0,T],
x∈Rd
that
v(t,x)=u(T−t,x2),
let
F:[0,T]×Rd×R→R
be the function which satisfies for every
t∈[0,T],
x∈Rd,
w∈R
that
F(t,x,w)=f(T−t,x2,w),
let
Fr:[0,T]×Rd×R→R, r∈(0,∞),
be the functions which satisfy for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
w∈R
that
Fr(t,x,w)=F(t,x,min{r,max{−r,w}}),
let
Sθ:Ω→[0,1], θ∈Θ,
satisfy for every
θ∈Θ
that
Sθ=1−Rθ,
let
Sθ:[0,T]×Ω→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Stθ=t+(T−t)Sθ,
for every
θ∈Θ,
t∈[0,T],
s∈[t,T],
x∈Rd
let
Yt,s,xθ:Ω→Rd
satisfy that
Yt,s,xθ=21XT−s,T−t,x2θ=x+WT−tθ−WT−sθ=x+(WTθ−WT−sθ)−(WTθ−WT−tθ),
and let
Vn,M,rθ:[0,T]×Rd×Ω→R,
θ∈Θ, n∈N0, M∈N, r∈(0,∞)
satisfy for every
n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
Vn,M,rθ(t,x)=Un,M,rθ(T−t,x2).
Note that (102) hence ensures for every
t∈[0,T),
x∈Rd
that
v∈C([0,T]×Rd,R),
v∣[0,T)×Rd∈C1,2([0,T)×Rd,R),
infa∈R[sup(s,y)∈[0,T]×Rd(ea∥y∥2∣v(s,y)∣)]<∞,
and
[TABLE]
In addition, note that the hypothesis that for every
t∈[0,T],
x∈Rd,
w∈R
it holds that
wf(t,x,w)≤c(1+w2)
guarantees that for every
t∈[0,T],
x∈Rd,
w∈R
it holds that
[TABLE]
Moreover, observe that it holds for every
t∈[0,T],
θ∈Θ
that
[TABLE]
Next observe that the assumption that for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
w,w∈[−r,r]
it holds that
∣f(t,x,w)−f(t,x,w)∣≤L(r)∣w−w∣
implies that for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
w,w∈[−r,r]
it holds that
[TABLE]
In addition, note that
[TABLE]
Furthermore, note that for every
t∈[0,T],
x∈Rd
it holds that
[TABLE]
and
[TABLE]
Moreover, observe that (103) guarantees for every
n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
[TABLE]
The fact that for every
θ∈Θ,
t∈[0,T],
s∈[t,T],
x∈Rd
it holds that
Xt,s,x2θ=2YT−s,T−t,xθ
and (107) therefore imply that for every
n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
it holds that
[TABLE]
Combining this with (103) and the fact that for every
M∈N,
θ∈Θ,
n∈N0,
r∈(0,∞),
t∈[0,T],
x∈Rd
it holds that
Vn,M,rθ(t,x)=Un,M,rθ(T−t,x2)
yields hat for every
θ∈Θ,
n,M∈N,
r∈(0,∞),
t∈[0,T],
x∈Rd
it holds that
V0,M,rθ(t,x)=0
and
[TABLE]
This and the fact that for every
r∈(0,∞),
t∈[0,T],
x∈Rd,
w∈R
it holds that
u(0,x2)=v(T,x)
and
Fr(t,x,w)=F(t,x,min{r,max{−r,w}})=f(T−t,x2,min{r,max{−r,w}})=fr(T−t,x2,w)
demonstrate that for every
θ∈Θ,
n,M∈N,
r∈(0,∞),
t∈[0,T],
x∈Rd
it holds that
V0,M,rθ(t,x)=0
and
[TABLE]
This, (105)–(111), and 3.4 (with
d=d,
T=T,
Θ=Θ,
f=F,
g=(Rd∋x↦v(T,x)=u(0,x2)∈R),
fr=Fr,
(Ω,F,P)=(Ω,F,P),
Rθ=Sθ,
Wθ=([0,T]×Ω∋(t,ω)↦WTθ(ω)−WT−tθ(ω)∈Rd),
Xt,s,xθ=Yt,s,xθ,
Rθ=Sθ,
Un,M,rθ=Vn,M,rθ,
ρ=ρ,
c=c,
∥⋅∥=∥⋅∥,
L=L,
u=v
for
θ∈Θ,
r∈(0,∞),
t∈[0,T],
s∈[t,T]x∈Rd
in the notation of 3.4) demonstrate that for every
n∈N0,
M∈N,
r∈[ρ,∞),
x∈Rd
it holds that
[TABLE]
Combining this with (111) and the fact that for every
θ∈Θ,
n∈N0,
M∈N,
r∈(0,∞),
t∈[0,T],
x∈Rd
it holds that
u(t,x)=v(T−t,\nicefracx2),
Un,M,rθ(t,x)=Vn,M,rθ(T−t,\nicefracx2),
and
2Y0,T,\nicefracx20=X0,T,x0
establishes (104). The proof of 3.5 is thus completed.
∎
4 Computational cost analysis for truncated MLP approximations
Our next goal is to estimate the overall complexity of the MLP approximation scheme. This is achieved in Theorem 4.5 below. We first quote an elementary result (see [24, Lemma 3.6]) which provides a bound for the computational cost. Lemma 4.2–Lemma 4.4 are technical statements needed for the proof of Theorem 4.5.
Lemma 4.1** (Computational cost).**
Let
d∈N,
(Cn,M)n∈N0,M∈N⊆N0
satisfy for every
n,M∈N
that
C0,M=0
and
This is an immediate consequence of [24, Lemma 3.6] (with
d=d,
RVn,M=Cn,M
for n∈N0, M∈N in the notation of [24, Lemma 3.6]).
The proof of Lemma 4.1 is thus completed.
∎
Lemma 4.2**.**
Let
α,β,c,κ,ρ∈(0,∞),
K∈N0,
(γn)n∈N⊆[0,∞),
(ϵn,r)n∈N,r∈[ρ,∞)⊆[0,∞),
let
L:(0,∞)→[0,∞)
be a function,
assume for every
n∈N,
r∈[ρ,∞)
that
γn≤(αn)n
and
ϵn,r≤ceL(r)κn(1+βL(r))nn−\nicefracn2,
and let
ϱ:N→(0,∞)
satisfy that
[TABLE]
Then there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
δ∈(0,∞),
ε∈(0,1]
it holds that
supn∈[1,Nε+K]∩Nγn≤cδε−(2+2δ)
and
supn∈[Nε,∞)∩Nϵn,ϱn≤ε.
Throughout this proof let
aδ∈[0,∞], δ∈(0,∞),
and
b∈[0,∞)
satisfy for every
δ∈(0,∞)
that
[TABLE]
and
[TABLE]
First, observe that the fact that for every
t∈(0,∞)
it holds that
ln(t)≤t−1
and
(118)
ensure that
[TABLE]
This and the fact that
lims→−∞es=0
imply that
[TABLE]
Hence, we obtain that there exist
Nε∈N, ε∈(0,∞),
which satisfy for every
ε∈(0,∞)
that
[TABLE]
Moreover, the assumption that
liminfn→∞ϱn=∞
implies that there exists
n∈N
which satisfies that
infn∈[n,∞)∩Nϱn≥ρ.
Next let
η∈(0,∞)
satisfy that
η<ceL(ϱn)κn(1+βL(ϱn))nn−\nicefracn2.
This implies for every
ε∈(0,η]
that
Nε>n.
Hence, we obtain that for every
ε∈(0,η]
it holds that
infn∈[Nε,∞)∩Nϱn≥infn∈[n,∞)∩Nϱn≥ρ.
This, the assumption that for every
n∈N,
r∈[ρ,∞)
it holds that
ϵn,r≤ceL(r)κn(1+βL(r))nn−\nicefracn2,
and (123) ensure that for every
ε∈(0,η]
it holds that
[TABLE]
Next let
E={ε∈(0,∞):Nε>1}.
Observe that (123) yields for every
ε∈E
that
[TABLE]
This and the assumption that for every
n∈N
it holds that
γn≤(αn)n
imply that for every
ε∈E,
δ∈(0,∞)
it holds that
[TABLE]
Next observe that the fact that for every
t∈(0,∞)
it holds that
ln(t)≤t−1
and (118) ensure once again that for every
δ∈(0,∞)
it holds that
[TABLE]
This, (118), and (119) imply for every
δ∈(0,∞)
that
[TABLE]
Next observe that the assumption that for every
n∈N
it holds that
γn≤(αn)n
and (120)
ensure that for every
ε∈(0,η]∖E,
δ∈(0,∞)
it holds that
[TABLE]
Combining this with
(119),
(120),
(124),
and
(126)
we obtain that for every
δ∈(0,∞),
ε∈(0,η]
it holds that
supn∈[Nε,∞)∩Nϵn,ϱn≤ε
and
[TABLE]
Next let
Nε∈N0, ε∈(0,1],
satisfy for every
ε∈(0,1]
that
[TABLE]
This and (130) ensure that for every
δ∈(0,∞),
ε∈(η,1]
it holds that
supn∈[Nε,∞)∩Nϵn,ρn=supn∈[Nη,∞)∩Nϵn,ρn≤η≤ε
and
[TABLE]
Combining this with
(130) and (131)
establishes that for every
δ∈(0,∞),
ε∈(0,1]
it holds that
First, note that the claim is clear in the case n=1. Next observe that for all
n∈N∩[2,∞)
it holds that
αn≥2.
This implies that for all
n∈N∩[2,∞)
it holds that
Let
α,β,c,κ,ρ∈(0,∞),
K∈N0,
(γn)n∈N⊆[0,∞),
(ϵn,r)n∈N,r∈[ρ,∞)⊆[0,∞),
let
L:(0,∞)→[0,∞)
be a function,
assume for every
n∈N,
r∈[ρ,∞)
that γn≤(αn)n
and
ϵn,r≤ceL(r)κn(1+βL(r))nn−\nicefracn2,
and let
ϱ:N→(0,∞)
satisfy
limsupn→∞(ln(n)L(ϱn)+ϱn1)=0.
Then there exist
N:(0,1]→N and
c:(0,∞)→[0,∞) such that for every
δ∈(0,∞),
ε∈(0,1]
it holds that
∑n=1Nε+Kγn≤cδε−(2+2δ)
and
supn∈[Nε,∞)∩Nϵn,ϱn≤ε.
First, observe that for every
n∈N
it holds that
γn≤(max{α,1}n)n.
Lemma 4.2
(with
α=max{α,1},
β=β,
c=c,
κ=κ,
ρ=ρ,
K=K,
L=L,
ϱn=ϱn,
γn=(max{α,1}n)n,
ϵn,r=ϵn,r
for
r∈[ρ,∞),
n∈N
in the notation of Lemma 4.2)
therefore guarantees that there exist
Nε∈N, ε∈(0,1],
and
cδ∈[0,∞), δ∈(0,∞),
such that for every
δ∈(0,∞),
ε∈(0,1]
it holds that
supn∈[1,Nε+K]∩N(max{α,1}n)n≤cδε−(2+2δ)
and
supn∈[Nε,∞)∩Nϵn,ϱn≤ε.
The fact that for every
n∈N
it holds that
γn≤(max{α,1}n)n,
the fact that for every
N∈N
it holds that
supn∈[1,N]∩N(max{α,1}n)n=(max{α,1}N)N,
and Lemma 4.3 hence imply that for every
ε∈(0,1]
it holds that
supn∈[Nε,∞)∩Nϵn,ϱn≤ε
and
Let
ρ,T∈(0,∞),
c,γ,p∈[0,∞),
K∈N0, Θ=∪n∈NZn,
(fd)d∈N,(fd,r)d∈N,r∈(0,∞)⊆C([0,T]×Rd×R,R),
let
L:(0,∞)→[0,∞) be a function,
let
(Ω,F,P)
be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wd,θ:[0,T]×Ω→Rd, d∈N, θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ
and
(Wd,θ)(d,θ)∈N×Θ
are independent,
let
Rθ:[0,T]×Ω→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Rtθ=tRθ,
for every
d∈N,
θ∈Θ, s∈[0,T],
t∈[s,T],
x∈Rd
let
Xs,t,xd,θ:Ω→Rd
satisfy
Xs,t,xd,θ=x+2(Wtd,θ−Wsd,θ),
assume for every
d∈N,
r∈(0,∞),
t∈(0,T],
x∈Rd,
u,v∈[−r,r],
w∈R
that
wfd(t,x,w)≤c(1+w2),
fd,r(t,x,w)=fd(t,x,min{r,max{−r,w}}),
E[∫0t∣fd(s,Xs,t,xd,0,0)∣ds]<∞,
and
∣fd(t,x,u)−fd(t,x,v)∣≤L(r)∣u−v∣,
let
ud∈C([0,T]×Rd,R), d∈N,
satisfy for every
d∈N,
t∈(0,T],
x∈Rd
that
ecT(1+∣ud(0,x)∣2)\nicefrac12≤ρ,
infa∈R[sups∈[0,T]supy=(y1,…,yd)∈Rd(ea(∣y1∣2+…+∣yd∣2)∣ud(s,y)∣)]<∞,
ud∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
and
[TABLE]
let
Un,M,rd,θ:[0,T]×Rd×Ω→R,
d,M∈N,
θ∈Θ,
n∈N0,
r∈(0,∞),
satisfy for every
d,n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
U0,M,rd,θ(t,x)=0
and
[TABLE]
let
ϱ:N→(0,∞)
satisfy limsupn→∞(ln(n)L(ϱn)+ϱn1)=0,
and let
Cd,n,M∈N0, d,M∈N, n∈N0,
satisfy for every
d,n,M∈N
that
Cd,0,M=0
and
[TABLE]
Then there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1],
x∈Rd
with
(∫0TE[∣fd(s,Xs,T,xd,0,0)∣2]ds)\nicefrac12≤γdp
it holds that
∑n=1N(ε/dp)+KCd,n,n≤cδd1+p(2+δ)ε−(2+δ)
and
Throughout this proof let
Xd⊆Rd, d∈N,
satisfy for every
d∈N
that
[TABLE]
let
ϵn,r∈[0,∞], n∈N, r∈(0,∞),
satisfy for every
n∈N,
r∈(0,∞)
that
[TABLE]
and let
γn∈[0,∞], n∈N,
satisfy for every
n∈N
that
[TABLE]
Note that Lemma 4.1 demonstrates that for every
d,n,M∈N
it holds that
Cd,n,M≤d(5M)n.
This implies for every
n∈N
that
[TABLE]
Next observe that 3.5 (with
d=d,
T=T,
Θ=Θ,
f=fd,
fr=fd,r,
(Ω,F,P)=(Ω,F,P),
Rθ=Rθ,
Wθ=Wd,θ,
Rθ=Rθ,
Xt,s,xθ=Xt,s,xd,θ,
Un,M,rθ(t,x)=Un,M,rd,θ(t,x),
ρ=ρ,
c=c,
∥⋅∥=(Rd∋y=(y1,…,yd)↦∣y1∣2+…+∣yd∣2∈R),
L=L,
u=ud
for
d,M∈N,
θ∈Θ, n∈N0, r∈(0,∞),
t∈[0,T],
s∈[t,T],
x∈Rd
in the notation of 3.5)
ensures that it holds for every
d,M∈N,
n∈N0,
r∈[ρ,∞),
x∈Rd
that
[TABLE]
This implies that for every
n∈N,
r∈[ρ,∞)
it holds that
[TABLE]
This, (143),
and Lemma 4.4 (with
α=5,
β=2,
c=1+supd∈Nsupx∈Rd∣ud(0,x)∣+γT,
κ=e,
ρ=ρ,
K=K,
L(s)=L(s)T,
γn=γn,
ϵn,r=ϵn,r,
ϱn=ϱn
for
n∈N,
r∈[ρ,∞),
s∈(0,∞)
in the notation of Lemma 4.2)
guarantee that there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
which satisfy that for every
δ∈(0,∞),
ε∈(0,1]
it holds that
[TABLE]
This implies that for every
d∈N,
δ∈(0,∞),
ε∈(0,1],
x∈Xd
it holds that
[TABLE]
and
[TABLE]
This establishes (139).
The proof of Theorem 4.5 is thus completed.
∎
5 MLP approximations for Allen–Cahn type partial differential equations
In this section we consider sample applications of Theorem 4.5. This provides us with examples of Allen–Cahn PDEs for which the curse of dimensionality can be broken in numerical approximations.
Corollary 5.1**.**
Let
T∈(0,∞),
c,ρ∈[0,∞),
K∈N0,
Θ=∪n∈NZn,
f∈C(R,R),
(fr)r∈(0,∞)⊆C(R,R),
let
L:(0,∞)→[0,∞)
be a function,
assume for every
r∈(0,∞),
u,v∈[−r,r],
w∈R
that
wf(w)≤c(1+w2),
fr(w)=f(min{r,max{−r,w}}),
and
∣f(u)−f(v)∣≤L(r)∣u−v∣,
let
ϱ:N→(0,∞)
satisfy
limsupn→∞(ln(n)L(ϱn)+ϱn1)=0,
let
ud∈C([0,T]×Rd,R), d∈N,
satisfy for every
d∈N,
t∈[0,T],
x∈Rd
that
ecT(1+∣ud(0,x)∣2)\nicefrac12≤ρ,
ud∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
infa∈R[sups∈[0,T]supy=(y1,…,yd)∈Rd(ea(∣y1∣2+…+∣yd∣2)∣ud(s,y)∣)]<∞,
and
[TABLE]
let
(Ω,F,P)
be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wd,θ:[0,T]×Ω→Rd,
d∈N, θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ and
(Wd,θ)(d,θ)∈N×Θ
are independent,
let
Rtθ:Ω→[0,t], θ∈Θ, t∈[0,T],
satisfy for every
t∈[0,T]
that
Rtθ=tRθ,
for every
d∈N,
t∈[0,T],
s∈[t,T],
x∈Rd,
θ∈Θ
let
Xt,s,xd,θ:Ω→Rd
satisfy
Xt,s,xd,θ=x+2(Wsd,θ−Wtd,θ),
let
Un,M,rd,θ:[0,T]×Rd×Ω→R,
θ∈Θ,
d,M∈N,
n∈N0,
r∈(0,∞),
satisfy for every
d,n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
U0,M,rd,θ(t,x)=0
and
[TABLE]
and let
Cd,n,M∈N0, d,M∈N, n∈N0,
satisfy for every
d,n,M∈N
that
Cd,0,M=0
and
[TABLE]
Then
(i)
it holds for every
d,M∈N,
n∈N0,
r∈[ρ,∞)
that
[TABLE]
and
2. (ii)
there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1]
it holds that
∑n=1Nε+KCd,n,n≤dcδε−(2+δ)
and
Throughout this proof let
Fd:[0,T]×Rd×R→R, d∈N,
be the functions which satisfy for every d∈N,
t∈[0,T],
x∈Rd,
w∈R
that
[TABLE]
Observe that the fact that for every
d∈N,
x∈Rd
it holds that
∣ud(0,x)∣≤ρ<∞
and (154) ensure that for every
d∈N,
t∈[0,T],
x∈Rd,
w∈R
it holds that
fr(w)=Fd(t,x,min{r,max{−r,w}}),
E[∫0t∣Fd(s,Xs,t,xd,0,0)∣ds]=t∣f(0)∣<∞,
(E[∫0T∣Fd(s,Xs,T,xd,0,0)∣2ds])\nicefrac12=T∣f(0)∣,
and
[TABLE]
This and Theorem 4.5 (with
ρ=ρ,
T=T, c=c,
γ=T∣f(0)∣,
p=0,
K=K,
Θ=Θ,
L=L,
fd=Fd, fd,r=([0,T]×Rd×R∋(t,x,y)↦fr(y)∈R),
ud=ud,
ϱ=ϱ,
(Ω,F,P)=(Ω,F,P),
Rθ=Rθ,
Wd,θ=Wd,θ,
Rθ=Rθ,
Xt,s,xd,θ=Xt,s,xd,θ,
Un,M,rd,θ(t,x)=Un,M,rd,θ(t,x),
Cd,n,M=Cd,n,M
for
d,M∈N,
θ∈Θ,
n∈N0,
r∈(0,∞),
t∈[0,T],
s∈[t,T],
x∈Rd in the notation of Theorem 4.5) ensure that
(I)
for every
d,M∈N,
n∈N0,
r∈[ρ,∞),
x∈Rd
it holds that
[TABLE]
and
2. (II)
there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1],
x∈Rd
it holds that
[TABLE]
This establishes Items (i) and (ii). The proof of 5.1 is thus completed.
∎
Corollary 5.2**.**
Let
T∈(0,∞),
c∈[0,∞),
K∈N0,
Θ=∪n∈NZn,
f∈C(R,R),
(fn)n∈N⊆C(R,R),
let
ϱ:N→(0,∞)
satisfy
limsupn→∞(ln(ln(n))ϱn)<∞=liminfn→∞ϱn, assume for every
n∈N,
u,v∈R
that
∣f(u)−f(v)∣≤c(1+∣u∣c+∣v∣c)∣u−v∣,
vf(v)≤c(1+v2),
and
fn(v)=f(min{ϱn,max{−ϱn,v}}),
let
ud∈C([0,T]×Rd,R), d∈N,
satisfy for every
d∈N,
t∈(0,T],
x∈Rd
that
infa∈R[sups∈[0,T]supy=(y1,…,yd)∈Rd(ea(∣y1∣2+…+∣yd∣2)∣ud(s,y)∣)]<∞,
∣ud(0,x)∣≤c,
ud∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
and
[TABLE]
let
(Ω,F,P)
be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wd,θ:[0,T]×Ω→Rd,
d∈N,
θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ
and
(Wd,θ)(d,θ)∈N×Θ
are independent,
let
Rθ:[0,T]×Ω→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Rtθ=tRθ,
for every
d∈N,
t∈[0,T],
s∈[t,T],
x∈Rd,
θ∈Θ
let
Xt,s,xd,θ:Ω→Rd
satisfy
Xt,s,xd,θ=x+2(Wsd,θ−Wtd,θ),
let
Un,Md,θ:[0,T]×Rd×Ω→R,
d,M∈N,
θ∈Θ,
n∈N0,
satisfy for every
d,n,M∈N,
θ∈Θ,
t∈[0,T],
x∈Rd
that
U0,Md,θ(t,x)=0
and
[TABLE]
and let
Cd,n,M∈N0,
d,M∈N,
n∈N0,
satisfy for every
d,n,M∈N
that
Cd,0,M=0
and
[TABLE]
Then there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1]
it holds that
Throughout this proof let
L:(0,∞)→[0,∞)
satisfy for every
r∈(0,∞)
that
L(r)=c(1+2rc),
let
Fr:R→R, r∈(0,∞),
be the functions which satisfy for every
r∈(0,∞),
v∈R
that
Fr(v)=f(min{r,max{−r,v}}),
and let
Vn,M,rd,θ:[0,T]×Rd×Ω→R,
d,M∈N,
θ∈Θ,
n∈N0,
satisfy for every
d,n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
Vn,M,rd,θ(0,x)=0
and
[TABLE]
Next observe that the hypothesis that
limsupn→∞(ln(ln(n))ϱn)<∞
implies that there exists
γ∈(0,∞)
which satisfies that for every
n∈[3,∞)∩N
it holds that
ϱn≤γln(ln(n)).
This yields that
[TABLE]
Next let
A⊆N0
be the set given by
[TABLE]
Note that the fact that for every
d,M∈N,
θ∈Θ,
t∈[0,T],
x∈Rd,
r∈(0,∞)
it holds that
V0,M,rd,θ(t,x)=0=U0,Md,θ(t,x)
ensures that
1∈A.
Moreover, note that (159), (162), and (164) ensure that for every
d,M∈N,
θ∈Θ,
n∈A,
t∈[0,T],
x∈Rd it holds that
[TABLE]
Hence, we obtain that for every
n∈A
it holds that
n+1∈A.
Combining this with the fact that
1∈A
and induction ensures that
A=N.
This yields that for every
d,M∈N,
θ∈Θ,
n∈N0,
t∈[0,T],
x∈Rd
it holds that
[TABLE]
The fact that for all
r∈(0,∞),
w,w∈[−r,r]
it holds that ∣f(w)−f(w)∣≤L(r)∣w−w∣,
(163),
and
5.1 (with
ρ=exp(Tsupv∈R(1+v2vf(v)))[1+supd∈Nsupx∈Rd∣ud(0,x)∣2]\nicefrac12,
c=supv∈R(1+v2vf(v)),
T=T,
K=K,
Θ=Θ,
f=f,
fr=fr,
L=L,
∥⋅∥d=∥⋅∥d,
ϱ=ϱ,
ud=ud,
(Ω,F,P)=(Ω,F,P),
RΘ=Rθ,
Wd,θ=Wd,θ,
Xt,s,xd,θ=Xt,s,xd,θ,
Un,M,rd,θ(t,x)=Vn,M,rd,θ(t,x),
Cd,n,M=Cd,n,M
for
d,M∈N,
θ∈Θ,
n∈N0,
r∈(0,∞),
t∈[0,T],
x∈Rd in the notation of 5.1) therefore guarantee that there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1]
it holds that
∑n=1Nε+KCd,n,n≤cδdε−(2+2δ)
and
Let
c,T∈(0,∞),
K∈N0,
Θ=∪n∈NZn,
for every
d∈N
let
∥⋅∥d:Rd→[0,∞)
be a norm on Rd,
let
ud∈C([0,T]×Rd,R), d∈N,
satisfy for every
d∈N,
t∈[0,T],
x∈Rd
that
∣ud(0,x)∣≤c,
infa∈R[sups∈[0,T]supy=(y1,…,yd)∈Rd(ea(∣y1∣2+…+∣yd∣2)∣ud(s,y)∣)]<∞,
ud∣(0,T]×Rd∈C1,2((0,T]×Rd,R),
and
[TABLE]
let
ϱ:N→(0,∞)
be a function which satisfies that
limsupn→∞(ln(ln(n))ϱn)<∞=liminfn→∞ϱn, let
fn:R→R, n∈N,
be the functions which satisfy for every
n∈N,
v∈R
that
fn(v)=(min{ϱn,max{−ϱn,v}})−(min{ϱn,max{−ϱn,v}})3,
let
(Ω,F,P)
be a probability space,
let
Rθ:Ω→[0,1], θ∈Θ,
be independent U[0,1]-distributed random variables,
let
Wd,θ:[0,T]×Ω→Rd,
d∈N,
θ∈Θ,
be independent standard Brownian motions,
assume that
(Rθ)θ∈Θ
and
(Wd,θ)(d,θ)∈N×Θ
are independent,
let
Rθ:Ω×[0,T]→[0,T], θ∈Θ,
satisfy for every
θ∈Θ,
t∈[0,T]
that
Rtθ=tRθ,
for every
d∈N,
s∈[0,T],
t∈[s,T],
x∈Rd,
θ∈Θ
let
Xs,td,θ:Ω→Rd
satisfy
Xs,t,xd,θ=x+2(Wtd,θ−Wsd,θ),
let
Un,Md,θ:[0,T]×Rd×Ω→R,
d,M∈N,
θ∈Θ,
n∈N0,
satisfy for every
d,n,M∈N,
θ∈Θ,
r∈(0,∞),
t∈[0,T],
x∈Rd
that
U0,Md,θ(t,x)=0
and
[TABLE]
and let
Cd,n,M∈N0, d,M∈N, n∈N0,
satisfy for every
d,n,M∈N
that
Cd,0,M=0
and
[TABLE]
Then there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1)
it holds that
First, observe that for every
r∈(0,∞),
v,w∈[−r,r]
it holds that
[TABLE]
Moreover, note that for every
v∈R
it holds that
v(v−v3)=v2−v4≤1+v2.
This, the hypothesis that for every
d∈N,
x∈Rd
it holds that
∣ud(0,x)∣≤c,
the fact that for every
d∈N
it holds that
∥⋅∥d
and the Euclidean norm on Rd are equivalent,
(172), and 5.2 (with
T=T,
c=max{c,2},
K=K,
Θ=Θ,
f=(R∋u↦u−u3∈R),
fM=fM,
ϱ=ϱ,
ud=ud,
(Ω,F,P)=(Ω,F,P),
Rθ=Rθ,
Wd,θ=Wd,θ,
Rθ=Rθ,
Xs,t,xd,θ=Xs,t,xd,θ,
Un,Md,θ(t,x)=Un,Md,θ(t,x),
Cd,n,M=Cd,n,M
for
d,M∈N,
θ∈Θ,
n∈N0,
r∈(0,∞),
t∈[0,T],
s∈[0,t],
x∈Rd
in the notation of 5.1)
ensure that there exist
N:(0,1]→N
and
c:(0,∞)→[0,∞)
such that for every
d∈N,
δ∈(0,∞),
ε∈(0,1]
it holds that
This project has been partially supported by the Deutsche Forschungsgemeinschaft (DFG) via research grant HU 1889/6-1.
F. H. gratefully acknowledges a Research Travel Grant by the Karlsruhe House of Young Scientists (KHYS) supporting his stay at ETH Zurich.
Bibliography37
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Andersson, A., Beck, C., Becker, S., Cheridito, P., Jentzen, A., and Neufeld, A. Deep splitting method for parabolic PD Es. ar Xiv:1907.03452 (2019), 40 pages.
2[2] Beck, C., Becker, S., Grohs, P., Jaafari, N., and Jentzen, A. Solving stochastic differential equations and Kolmogorov equations by means of deep learning. ar Xiv:1806.00421 (2018), 56 pages.
3[3] Beck, C., E, W., and Jentzen, A. Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations. Journal of Nonlinear Science (2017), 1–57.
4[4] Becker, S., Cheridito, P., and Jentzen, A. Deep optimal stopping. To appear in The Journal of Machine Learning Research, ar Xiv:1804.05394 (2018), 26 pages.
5[5] Berg, J., and Nyström, K. A unified deep artificial neural network approach to partial differential equations in complex geometries. Neurocomputing 317 (2018), 28–41.
6[6] Bouchard, B., Tan, X., Warin, X., and Zou, Y. Numerical approximation of BSD Es using local polynomial drivers and branching processes. Monte Carlo Methods Appl. 23 , 4 (2017), 241–263.
7[7] Brezis, H. Functional analysis, Sobolev spaces and partial differential equations . Springer Science & Business Media, 2010.
8[8] Chan-Wai-Nam, Q., Mikael, J., and Warin, X. Machine learning for semi linear PD Es. ar Xiv:1809.07609 (2018), 38 pages.