Related papers: Adaptive time-stepping for Stochastic Partial Diff…
We develop a fully discrete, semi-implicit mixed finite element method for approximating solutions to a class of fourth-order stochastic partial differential equations (SPDEs) with non-globally Lipschitz and non-monotone nonlinearities,…
There is a rising interest in Spatio-temporal systems described by Partial Differential Equations (PDEs) among the control community. Not only are these systems challenging to control, but the sizing and placement of their actuation is an…
For the approximation of solutions for stochastic partial differential equations, numerical methods that obtain a high order of convergence and at the same time involve reasonable computational cost are of particular interest. We therefore…
The strong convergence of Euler approximations of stochastic delay differential equations is proved under general conditions. The assumptions on drift and diffusion coefficients have been relaxed to include polynomial growth and only…
A fully discrete approximation of the semi-linear stochastic wave equation driven by multiplicative noise is presented. A standard linear finite element approximation is used in space and a stochastic trigonometric method for the temporal…
Recent work has established an empirically successful framework for adapting learning rates for stochastic gradient descent (SGD). This effectively removes all needs for tuning, while automatically reducing learning rates over time on…
Parameter estimation for a parabolic linear stochastic partial differential equation in one space dimension is studied observing the solution field on a discrete grid in a fixed bounded domain. Considering an infill asymptotic regime in…
Solving time-dependent partial differential equations (PDEs) that exhibit sharp gradients or local singularities is computationally demanding, as traditional physics-informed neural networks (PINNs) often suffer from inefficient point…
We analyze a variable-step extension of a family of arbitrarily high-order exponential time differencing multistep (ETD-MS) schemes recently developed by the authors. We prove that the schemes are unconditionally stable in the sense that a…
We survey recent developments in the field of complexity of pathwise approximation in $p$-th mean of the solution of a stochastic differential equation at the final time based on finitely many evaluations of the driving Brownian motion.…
For stochastic differential equations (SDEs) with a superlinearly growing and globally one-sided Lipschitz continuous drift coefficient, the classical explicit Euler scheme fails to converge strongly to the exact solution. Recently, an…
Stochastic gradient descent is the method of choice for large scale optimization of machine learning objective functions. Yet, its performance is greatly variable and heavily depends on the choice of the stepsizes. This has motivated a…
We are concerned with the discretization of a solution of a Forward-Backward stochastic differential equation (FBSDE) with a jump process depending on the Brownian motion. In this paper, we study the cases of Lipschitz generators and the…
In this article, we extend a Milstein finite difference scheme introduced in [Giles & Reisinger(2011)] for a certain linear stochastic partial differential equation (SPDE), to semi- and fully implicit timestepping as introduced by…
The present work introduces and investigates an explicit time discretization scheme, called the projected Euler method,to numerically approximate random periodic solutions of semi-linear SDEs under non-globally Lipschitz conditions. The…
A fully discrete approximation of the linear stochastic wave equation driven by additive noise is presented. A standard finite element method is used for the spatial discretisation and a stochastic trigonometric scheme for the temporal…
We study a finite-element based space-time discretisation for the 2D stochastic Navier-Stokes equations in a bounded domain supplemented with no-slip boundary conditions. We prove optimal convergence rates in the energy norm with respect to…
We consider a generic convex-concave saddle point problem with separable structure, a form that covers a wide-ranged machine learning applications. Under this problem structure, we follow the framework of primal-dual updates for saddle…
This work continues a line of works on developing partially explicit methods for multiscale problems. In our previous works, we have considered linear multiscale problems, where the spatial heterogeneities are at subgrid level and are not…
Stochastic Gradient Descent (SGD) is a popular tool in training large-scale machine learning models. Its performance, however, is highly variable, depending crucially on the choice of the step sizes. Accordingly, a variety of strategies for…