Related papers: A note on convergence and stability of the truncat…
In the paper, we propose a higher-order geometry-preserving numerical method for stochastic differential equations (SDEs) evolving on the Lie groups SO(n) and SE(n). Most existing Lie group integrators rely on Magnus expansion of the…
This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…
The two-step time discretization proposed by Dahlquist, Liniger and Nevanlinna is variable step $G$-stable. (In contrast, for increasing time steps, the BDF2 method loses $A$-stability and suffers non-physical energy growth in the…
Chung's Lemma is a classical tool for establishing asymptotic convergence rates of (stochastic) optimization methods under strong convexity-type assumptions and appropriate polynomial diminishing step sizes. In this work, we develop a…
In this paper, the truncated Euler-Maruyama (EM) method is employed together with the Multi-level Monte Carlo (MLMC) method to approximate the expectations of functions of solutions to stochastic differential equations (SDEs). The…
We present novel minibatch stochastic optimization methods for empirical risk minimization problems, the methods efficiently leverage variance reduced first-order and sub-sampled higher-order information to accelerate the convergence speed.…
The stochastic proximal point (SPP) methods have gained recent attention for stochastic optimization, with strong convergence guarantees and superior robustness to the classic stochastic gradient descent (SGD) methods showcased at little to…
The convergence of stochastic gradient descent is highly dependent on the step-size, especially on non-convex problems such as neural network training. Step decay step-size schedules (constant and then cut) are widely used in practice…
In this paper, we study the convergence of the Euler-Maruyama numerical solutions for pantograph stochastic functional differential equations which was proposed in [11]. We also show that the numerical solutions have the properties of…
Recently, many machine learning optimizers have been analysed considering them as the asymptotic limit of some differential equations when the step size goes to zero. In other words, the optimizers can be seen as a finite difference scheme…
The dynamical stability of optimization methods at the vicinity of minima of the loss has recently attracted significant attention. For gradient descent (GD), stable convergence is possible only to minima that are sufficiently flat w.r.t.…
Models incorporating uncertain inputs, such as random forces or material parameters, have been of increasing interest in PDE-constrained optimization. In this paper, we focus on the efficient numerical minimization of a convex and smooth…
The matter of the stability for multi-asset American option pricing problems is a present remaining challenge. In this paper a general transformation of variables allows to remove cross derivative terms reducing the stencil of the proposed…
The use of heuristics to assess the convergence and compress the output of Markov chain Monte Carlo can be sub-optimal in terms of the empirical approximations that are produced. Typically a number of the initial states are attributed to…
In the study of McKean-Vlasov stochastic differential equations (MV-SDEs), numerical approximation plays a crucial role in understanding the behavior of interacting particle systems (IPS). Classical Milstein schemes provide strong…
In this paper, the convergence of the solutions for a discretized linear state-based static peridynamic system to the corresponding continuous solution is analytically proven. To obtain an implementable model, we further apply…
In this paper we introduce adaptive time step control for simulation of evolution of ice sheets. The discretization error in the approximations is estimated using "Milne's device" by comparing the result from two different methods in a…
Stochastic gradient descent (SGD) is commonly used for optimization in large-scale machine learning problems. Langford et al. (2009) introduce a sparse online learning method to induce sparsity via truncated gradient. With high-dimensional…
Numerical analysis for linear constant-coefficients Finite Difference schemes was developed approximately fifty years ago. It relies on the assumption of scheme stability and in particular -- for the $L^2$ setting -- on the absence of…
We study discrete-time simulation schemes for stochastic Volterra equations, namely the Euler and Milstein schemes, and the corresponding Multi-Level Monte-Carlo method. By using and adapting some results from Zhang [22], together with the…