Related papers: An Adaptive Euler-Maruyama Scheme For SDEs: Conver…
This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in…
This work focuses on the numerical approximations of neutral stochastic delay differential equations with their drift and diffusion coefficients growing super-linearly with respect to both delay variables and state variables. Under…
We introduce an explicit, adaptive time-stepping scheme for the simulation of SPDEs with one-sided Lipschitz drift coefficients. Strong convergence rates are proven for the full space-time discretisation with multiplicative trace-class…
Given a stochastic differential equation (SDE) in $\mathbb{R}^n$ whose solution is constrained to lie in some manifold $M \subset \mathbb{R}^n$, we propose a class of numerical schemes for the SDE whose iterates remain close to $M$ to high…
The Ensemble Kalman methodology in an inverse problems setting can be viewed as an iterative scheme, which is a weakly tamed discretization scheme for a certain stochastic differential equation (SDE). Assuming a suitable approximation…
By establishing the regularity estimates for nonlocal Stein/Poisson equations under $\gamma$-order H\"older and dissipative conditions on the coefficients, we derive the $W_{\bf d}$-convergence rate for the Euler-Maruyama schemes applied to…
The aim of this paper is to study weak and strong convergence of the Euler--Maruyama scheme for a solution of one-dimensional degenerate stochastic differential equation $\mathrm{d} X_t=\sigma(X_t) \mathrm{d} W_t$ with non-sticky condition.…
In this paper, we first propose a filter-based continuous Ensemble Eddy Viscosity (EEV) model for stochastic turbulent flow problems. We then propose a generic algorithm for a family of fully discrete, grad-div regularized, efficient…
In this paper we study the existence and uniqueness of the random periodic solution for a stochastic differential equation with a one-sided Lipschitz condition (also known as monotonicity condition) and the convergence of its numerical…
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…
The classical analysis of Stochastic Gradient Descent (SGD) with polynomially decaying stepsize $\eta_t = \eta/\sqrt{t}$ relies on well-tuned $\eta$ depending on problem parameters such as Lipschitz smoothness constant, which is often…
This paper presents the first sufficient conditions that guarantee the stability and almost sure convergence of multi-timescale stochastic approximation (SA) iterates. It extends the existing results on one-timescale and two-timescale SA…
We consider the stability problems of one dimensional SDEs when the diffusion coefficients satisfy the so called Nakao-Le Gall condition. The explicit rate of convergence of the stability problems are given by the Yamada-Watanabe method…
In this paper, by employing the asymptotic expansion method, we prove the existence and uniqueness of a smoothing solution for a time-dependent nonlinear singularly perturbed partial differential equation (PDE) with a small-scale parameter.…
We consider the long-time behavior of an explicit tamed exponential Euler scheme applied to a class of parabolic semilinear stochastic partial differential equations driven by additive noise, under a one-sided Lipschitz continuity…
We consider the numerical approximation of a general second order semi--linear parabolic stochastic partial differential equation (SPDE) driven by additive space-time noise. We introduce a new modified scheme using a linear functional of…
The classical Method of Successive Approximations (MSA) is an iterative method for solving stochastic control problems and is derived from Pontryagin's optimality principle. It is known that the MSA may fail to converge. Using careful…
In adversarial machine learning, neural networks suffer from a significant issue known as robust overfitting, where the robust test accuracy decreases over epochs (Rice et al., 2020). Recent research conducted by Xing et al.,2021; Xiao et…
In this paper we study the stability and its trade-off with optimization error for stochastic gradient descent (SGD) algorithms in the pairwise learning setting. Pairwise learning refers to a learning task which involves a loss function…
We consider the problem of convergence to a saddle point of a concave-convex function via gradient dynamics. Since first introduced by Arrow, Hurwicz and Uzawa in [1] such dynamics have been extensively used in diverse areas, there are,…