相关论文: Optimal Strong Approximation of the One-dimensiona…

Asynchronous stochastic gradient descent (ASGD) is a popular parallel optimization algorithm in machine learning. Most theoretical analysis on ASGD take a discrete view and prove upper bounds for their convergence rates. However, the…

In this paper, we present a deep learning-based numerical method for approximating high dimensional stochastic partial differential equations (SPDEs). At each time step, our method relies on a predictor-corrector procedure. More precisely,…

We study the approximation of backward stochastic differential equations (BSDEs for short) with a constraint on the gains process. We first discretize the constraint by applying a so-called facelift operator at times of a grid. We show that…

We consider a stochastic differential equation of the form $dr_t = (a - b r_t) dt + \sigma\sqrt{r_t}dW_t$, where $a$, $b$ and $\sigma$ are positive constants. The solution corresponds to the Cox-Ingersoll-Ross process. We study the…

We study a discrete time approximation scheme for the solution of a doubly reflected Backward Stochastic Differential Equation (DBBSDE in short) with jumps, driven by a Brownian motion and an independent compensated Poisson process.…

High-order tensor methods that employ Taylor-based local models (of degree $p\ge 3$) within adaptive regularization frameworks have been recently proposed for both convex and nonconvex optimization problems. They have been shown to have…

Let $d\geq 2$. In this paper, we investigate the following stochastic differential equation (SDE) in ${\mathbb R}^d$ driven by Brownian motion $$ {\rm d} X_t=b(t,X_t){\rm d} t+\sqrt{2}{\rm d} W_t, $$ where $b$ belongs to the space ${\mathbb…

We consider the stochastic Cahn-Hilliard equation driven by additive Gaussian noise in a convex domain with polygonal boundary in dimension $d\le 3$. We discretize the equation using a standard finite element method in space and a fully…

The proximal gradient algorithm has been popularly used for convex optimization. Recently, it has also been extended for nonconvex problems, and the current state-of-the-art is the nonmonotone accelerated proximal gradient algorithm.…

The proximal inertial gradient descent is efficient for the composite minimization and applicable for broad of machine learning problems. In this paper, we revisit the computational complexity of this algorithm and present other novel…

The rates of strong convergence for various approximation schemes are investigated for a class of stochastic differential equations (SDEs) which involve a random time change given by an inverse subordinator. SDEs to be considered are unique…

The self-consistent expansion (SCE) is a powerful technique for obtaining perturbative solutions to problems in statistical physics but it suffers from a subtle problem - too much freedom! The SCE can be used to generate an enormous number…

The Sinc approximation is known to be a highly efficient approximation formula for rapidly decreasing functions. For unilateral rapidly decreasing functions, which rapidly decrease as $x\to\infty$ but does not as $x\to-\infty$, an…

The Ray--Knight theorems show that the local time processes of various path fragments derived from a one-dimensional Brownian motion $B$ are squared Bessel processes of dimensions $0$, $2$, and $4$. It is also known that for various…

In this paper, we study the strong and weak convergence rates for multi-scale one-dimensional stochastic Burgers equation. Based on the techniques of Galerkin approximation, Kolmogorov equation and Poisson equation, we obtain the slow…

We propose an {\em implementable} numerical scheme for the discretization of linear-quadratic optimal control problems involving SDEs in higher dimensions with {\em control constraint}. For time discretization, we employ the implicit Euler…

In this paper, we study a class of slow-fast stochastic partial differential equations with multiplicative Wiener noise. Under some appropriate conditions, we prove the slow component converges to the solution of the corresponding averaged…

This paper proposes an explicit computational method for solving a three-dimensional system of nonlinear elastodynamic sine-Gordon equations subject to appropriate initial and boundary conditions. The time derivative is approximated by…

We analyze exponential integrability properties of the Cox-Ingersoll-Ross (CIR) process and its Euler discretizations with various types of truncation and reflection at 0. These properties play a key role in establishing the finiteness of…

The drift sequential parameter estimation problems for the Cox-Ingersoll-Ross (CIR) processes under the limited duration of observation are studied. Truncated sequential estimation methods for both scalar and {two}-dimensional parameter…