Searcharxiv⌕ Search

arXiv subjects

Arnulf Jentzen

Publications and source records attributed to Arnulf Jentzen.

At least 127 records · Page 7Linked to original sources

Existence and uniqueness properties for solutions of a class of Banach space valued evolution equations

In this note we provide a self-contained proof of an existence and uniqueness result for a class of Banach space valued evolution equations with an additive forcing term. The framework of our abstract result includes, for example, finite dimensional ordinary differential equations (ODEs), semilinear deterministic partial differential equations (PDEs), as well as certain additive noise driven stochastic partial differential equations (SPDEs) as special cases. The framework of our general result assumes somehow mild regularity conditions on the involved semigroup and also allows the involved semigroup operators to be nonlinear. The techniques used in the proofs of our results are essentially well-known in the relevant literature. The contribution of this note is to provide a rather general existence and uniqueness result which covers several situations as special cases and also to provide a self-contained proof for this existence and uniqueness result.

math.CA↗

Exponential moment bounds and strong convergence rates for tamed-truncated numerical approximations of stochastic convolutions

In this article we establish exponential moment bounds, moment bounds in fractional order smoothness spaces, a uniform Hölder continuity in time, and strong convergence rates for a class of fully discrete exponential Euler-type numerical approximations of infinite dimensional stochastic convolution processes. The considered approximations involve specific taming and truncation terms and are therefore well suited to be used in the context of SPDEs with non-globally Lipschitz continuous nonlinearities.

math.PR↗

On the Alekseev-Gröbner formula in Banach spaces

The Alekseev-Gröbner formula is a well known tool in numerical analysis for describing the effect that a perturbation of an ordinary differential equation (ODE) has on its solution. In this article we provide an extension of the Alekseev-Gröbner formula for Banach space valued ODEs under, loosely speaking, mild conditions on the perturbation of the considered ODEs.

math.CA↗

Solving high-dimensional partial differential equations using deep learning

Developing algorithms for solving high-dimensional partial differential equations (PDEs) has been an exceedingly difficult task for a long time, due to the notoriously difficult problem known as the "curse of dimensionality". This paper introduces a deep learning-based approach that can handle general high-dimensional parabolic PDEs. To this end, the PDEs are reformulated using backward stochastic differential equations and the gradient of the unknown solution is approximated by neural networks, very much in the spirit of deep reinforcement learning with the gradient acting as the policy function. Numerical results on examples including the nonlinear Black-Scholes equation, the Hamilton-Jacobi-Bellman equation, and the Allen-Cahn equation suggest that the proposed algorithm is quite effective in high dimensions, in terms of both accuracy and cost. This opens up new possibilities in economics, finance, operational research, and physics, by considering all participating agents, assets, resources, or particles together at the same time, instead of making ad hoc assumptions on their inter-relationships.

math.NA↗

Lower error bounds for the stochastic gradient descent optimization algorithm: Sharp convergence rates for slowly and fast decaying learning rates

The stochastic gradient descent (SGD) optimization algorithm plays a central role in a series of machine learning applications. The scientific literature provides a vast amount of upper error bounds for the SGD method. Much less attention as been paid to proving lower error bounds for the SGD method. It is the key contribution of this paper to make a step in this direction. More precisely, in this article we establish for every $γ, ν\in (0,\infty)$ essentially matching lower and upper bounds for the mean square error of the SGD process with learning rates $(\fracγ{n^ν})_{n \in \mathbb{N}}$ associated to a simple quadratic stochastic optimization problem. This allows us to precisely quantify the mean square convergence rate of the SGD method in dependence on the asymptotic behavior of the learning rates.

math.NA↗

Strong error analysis for stochastic gradient descent optimization algorithms

Stochastic gradient descent (SGD) optimization algorithms are key ingredients in a series of machine learning applications. In this article we perform a rigorous strong error analysis for SGD optimization algorithms. In particular, we prove for every arbitrarily small $\varepsilon \in (0,\infty)$ and every arbitrarily large $p\in (0,\infty)$ that the considered SGD optimization algorithm converges in the strong $L^p$-sense with order $\frac{1}{2}-\varepsilon$ to the global minimum of the objective function of the considered stochastic approximation problem under standard convexity-type assumptions on the objective function and relaxed assumptions on the moments of the stochastic errors appearing in the employed SGD optimization algorithm. The key ideas in our convergence proof are, first, to employ techniques from the theory of Lyapunov-type functions for dynamical systems to develop a general convergence machinery for SGD optimization algorithms based on such functions, then, to apply this general machinery to concrete Lyapunov-type functions with polynomial structures, and, thereafter, to perform an induction argument along the powers appearing in the Lyapunov-type functions in order to achieve for every arbitrarily large $ p \in (0,\infty) $ strong $ L^p $-convergence rates. This article also contains an extensive review of results on SGD optimization algorithms in the scientific literature.

math.NA↗

Strong convergence rates for explicit space-time discrete numerical approximations of stochastic Allen-Cahn equations

The scientific literature contains a number of numerical approximation results for stochastic partial differential equations (SPDEs) with superlinearly growing nonlinearities but, to the best of our knowledge, none of them prove strong or weak convergence rates for full-discrete numerical approximations of space-time white noise driven SPDEs with superlinearly growing nonlinearities. In particular, in the scientific literature there exists neither a result which proves strong convergence rates nor a result which proves weak convergence rates for full-discrete numerical approximations of stochastic Allen-Cahn equations. In this article we bridge this gap and establish strong convergence rates for full-discrete numerical approximations of space-time white noise driven SPDEs with superlinearly growing nonlinearities such as stochastic Allen-Cahn equations. Moreover, we also establish lower bounds for strong temporal and spatial approximation errors which demonstrate that our strong convergence rates are essentially sharp and can, in general, not be improved.

math.PR↗

On arbitrarily slow convergence rates for strong numerical approximations of Cox-Ingersoll-Ross processes and squared Bessel processes

Cox-Ingersoll-Ross (CIR) processes are extensively used in state-of-the-art models for the approximative pricing of financial derivatives. In particular, CIR processes are day after day employed to model instantaneous variances (squared volatilities) of foreign exchange rates and stock prices in Heston-type models and they are also intensively used to model short-rate interest rates. The prices of the financial derivatives in the above mentioned models are very often approximately computed by means of explicit or implicit Euler- or Milstein-type discretization methods based on equidistant evaluations of the driving noise processes. In this article we study the strong convergence speeds of all such discretization methods. More specifically, the main result of this article reveals that each such discretization method achieves at most a strong convergence order of $δ/2$, where $0<δ<2$ is the dimension of the squared Bessel process associated to the considered CIR process. In particular, we thereby reveal that discretization methods currently employed in the financial industry may converge with arbitrarily slow strong convergence rates to the solution of the considered CIR process. We thereby lay open the need of the development of other more sophisticated approximation methods which are capable to solve CIR processes in the strong sense in a reasonable computational time and which thus can not belong to the class of algorithms which use equidistant evaluations of the driving noise processes.

math.NA↗

Strong convergence for explicit space-time discrete numerical approximation methods for stochastic Burgers equations

In this paper we propose and analyze explicit space-time discrete numerical approximations for additive space-time white noise driven stochastic partial differential equations (SPDEs) with non-globally monotone nonlinearities such as the stochastic Burgers equation with space-time white noise. The main result of this paper proves that the proposed explicit space-time discrete approximation method converges strongly to the solution process of the stochastic Burgers equation with space-time white noise. To the best of our knowledge, the main result of this work is the first result in the literature which establishes strong convergence for a space-time discrete approximation method in the case of the stochastic Burgers equations with space-time white noise.

math.NA↗

Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations

High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number of financial assets in a portfolio. Moreover, such PDEs are often fully nonlinear due to the need to incorporate certain nonlinear phenomena in the model such as default risks, transaction costs, volatility uncertainty (Knightian uncertainty), or trading constraints in the model. Such high-dimensional fully nonlinear PDEs are exceedingly difficult to solve as the computational effort for standard approximation methods grows exponentially with the dimension. In this work we propose a new method for solving high-dimensional fully nonlinear second-order PDEs. Our method can in particular be used to sample from high-dimensional nonlinear expectations. The method is based on (i) a connection between fully nonlinear second-order PDEs and second-order backward stochastic differential equations (2BSDEs), (ii) a merged formulation of the PDE and the 2BSDE problem, (iii) a temporal forward discretization of the 2BSDE and a spatial approximation via deep neural nets, and (iv) a stochastic gradient descent-type optimization procedure. Numerical results obtained using ${\rm T{\small ENSOR}F{\small LOW}}$ in ${\rm P{\small YTHON}}$ illustrate the efficiency and the accuracy of the method in the cases of a $100$-dimensional Black-Scholes-Barenblatt equation, a $100$-dimensional Hamilton-Jacobi-Bellman equation, and a nonlinear expectation of a $ 100 $-dimensional $ G $-Brownian motion.

math.NA↗

Weak convergence rates of spectral Galerkin approximations for SPDEs with nonlinear diffusion coefficients

Strong convergence rates for (temporal, spatial, and noise) numerical approximations of semilinear stochastic evolution equations (SEEs) with smooth and regular nonlinearities are well understood in the scientific literature. Weak convergence rates for numerical approximations of such SEEs have been investigated since about 11 years and are far away from being well understood: roughly speaking, no essentially sharp weak convergence rates are known for parabolic SEEs with nonlinear diffusion coefficient functions; see Remark 2.3 in [A. Debussche, Weak approximation of stochastic partial differential equations: the nonlinear case, Math. Comp. 80 (2011), no. 273, 89-117] for details. In this article we solve the weak convergence problem emerged from Debussche's article in the case of spectral Galerkin approximations and establish essentially sharp weak convergence rates for spatial spectral Galerkin approximations of semilinear SEEs with nonlinear diffusion coefficient functions. Our solution to the weak convergence problem does not use Malliavin calculus. Rather, key ingredients in our solution to the weak convergence problem emerged from Debussche's article are the use of appropriately modified versions of the spatial Galerkin approximation processes and applications of a mild Itô type formula for solutions and numerical approximations of semilinear SEEs. This article solves the weak convergence problem emerged from Debussche's article merely in the case of spatial spectral Galerkin approximations instead of other more complicated numerical approximations. Our method of proof extends, however, to a number of other kind of spatial, temporal, and noise numerical approximations for semilinear SEEs.

math.PR↗

On multilevel Picard numerical approximations for high-dimensional nonlinear parabolic partial differential equations and high-dimensional nonlinear backward stochastic differential equations

Parabolic partial differential equations (PDEs) and backward stochastic differential equations (BSDEs) are key ingredients in a number of models in physics and financial engineering. In particular, parabolic PDEs and BSDEs are fundamental tools in the state-of-the-art pricing and hedging of financial derivatives. The PDEs and BSDEs appearing in such applications are often high-dimensional and nonlinear. Since explicit solutions of such PDEs and BSDEs are typically not available, it is a very active topic of research to solve such PDEs and BSDEs approximately. In the recent article [E, W., Hutzenthaler, M., Jentzen, A., and Kruse, T. Linear scaling algorithms for solving high-dimensional nonlinear parabolic differential equations. arXiv:1607.03295 (2017)] we proposed a family of approximation methods based on Picard approximations and multilevel Monte Carlo methods and showed under suitable regularity assumptions on the exact solution for semilinear heat equations that the computational complexity is bounded by $O( d \, ε^{-(4+δ)})$ for any $δ\in(0,\infty)$, where $d$ is the dimensionality of the problem and $ε\in(0,\infty)$ is the prescribed accuracy. In this paper, we test the applicability of this algorithm on a variety of $100$-dimensional nonlinear PDEs that arise in physics and finance by means of numerical simulations presenting approximation accuracy against runtime. The simulation results for these 100-dimensional example PDEs are very satisfactory in terms of accuracy and speed. In addition, we also provide a review of other approximation methods for nonlinear PDEs and BSDEs from the literature.

math.NA↗

On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions

In the recent article [Jentzen, A., Müller-Gronbach, T., and Yaroslavtseva, L., Commun. Math. Sci., 14(6), 1477--1500, 2016] it has been established that for every arbitrarily slow convergence speed and every natural number $d \in \{4,5,\ldots\}$ there exist $d$-dimensional stochastic differential equations (SDEs) with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper we strengthen the above result by proving that this slow convergence phenomena also arises in two ($d=2$) and three ($d=3$) space dimensions.

math.NA↗

Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations

We propose a new algorithm for solving parabolic partial differential equations (PDEs) and backward stochastic differential equations (BSDEs) in high dimension, by making an analogy between the BSDE and reinforcement learning with the gradient of the solution playing the role of the policy function, and the loss function given by the error between the prescribed terminal condition and the solution of the BSDE. The policy function is then approximated by a neural network, as is done in deep reinforcement learning. Numerical results using TensorFlow illustrate the efficiency and accuracy of the proposed algorithms for several 100-dimensional nonlinear PDEs from physics and finance such as the Allen-Cahn equation, the Hamilton-Jacobi-Bellman equation, and a nonlinear pricing model for financial derivatives.

math.NA↗

Strong convergence of full-discrete nonlinearity-truncated accelerated exponential Euler-type approximations for stochastic Kuramoto-Sivashinsky equations

This article introduces and analyzes a new explicit, easily implementable, and full discrete accelerated exponential Euler-type approximation scheme for additive space-time white noise driven stochastic partial differential equations (SPDEs) with possibly non-globally monotone nonlinearities such as stochastic Kuramoto-Sivashinsky equations. The main result of this article proves that the proposed approximation scheme converges strongly and numerically weakly to the solution process of such an SPDE. Key ingredients in the proof of our convergence result are a suitable generalized coercivity-type condition, the specific design of the accelerated exponential Euler-type approximation scheme, and an application of Fernique's theorem.

math.PR↗

Counterexamples to regularities for the derivative processes associated to stochastic evolution equations

In the recent years there has been an increased interest in studying regularity properties of the derivatives of stochastic evolution equations (SEEs) with respect to their initial values. In particular, in the scientific literature it has been shown for every natural number $n\in\mathbb{N}$ that if the nonlinear drift coefficient and the nonlinear diffusion coefficient of the considered SEE are $n$-times continuously Fréchet differentiable, then the solution of the considered SEE is also $n$-times continuously Fréchet differentiable with respect to its initial value and the corresponding derivative processes satisfy a suitable regularity property in the sense that the $n$-th derivative process can be extended continuously to $n$-linear operators on negative Sobolev-type spaces with regularity parameters $δ_1,δ_2,\ldots,δ_n\in[0,1/2)$ provided that the condition $ \sum^n_{i=1} δ_i < 1/2 $ is satisfied. The main contribution of this paper is to reveal that this condition can essentially not be relaxed.

math.PR↗

Lower bounds for weak approximation errors for spatial spectral Galerkin approximations of stochastic wave equations

Although for a number of semilinear stochastic wave equations existence and uniqueness results for corresponding solution processes are known from the literature, these solution processes are typically not explicitly known and numerical approximation methods are needed in order for mathematical modelling with stochastic wave equations to become relevant for real world applications. This, in turn, requires the numerical analysis of convergence rates for such numerical approximation processes. A recent article by the authors proves upper bounds for weak errors for spatial spectral Galerkin approximations of a class of semilinear stochastic wave equations. The findings there are complemented by the main result of this work, that provides lower bounds for weak errors which show that in the general framework considered the established upper bounds can essentially not be improved.

math.PR↗

Weak convergence rates for numerical approximations of stochastic partial differential equations with nonlinear diffusion coefficients in UMD Banach spaces

Strong convergence rates for numerical approximations of semilinear stochastic partial differential equations (SPDEs) with smooth and regular nonlinearities are well understood in the literature. Weak convergence rates for numerical approximations of such SPDEs have been investigated for about two decades and are still not yet fully understood. In particular, no essentially sharp weak convergence rates are known for temporal or spatial numerical approximations of space-time white noise driven SPDEs with nonlinear multiplication operators in the diffusion coefficients. In this article we overcome this problem by establishing essentially sharp weak convergence rates for exponential Euler approximations of semilinear SPDEs with nonlinear multiplication operators in the diffusion coefficients. Key ingredients of our approach are applications of the mild Itô type formula in UMD Banach spaces with type 2.

math.PR↗