Related papers: Truncated Milstein method for non-autonomous stoch…
In this paper, we first derive Milstein schemes for an interacting particle system associated with point delay McKean-Vlasov stochastic differential equations (McKean-Vlasov SDEs), possibly with a drift term exhibiting super-linear growth…
We introduce a new class of numerical methods for solving McKean-Vlasov stochastic differential equations, which are relevant in the context of distribution-dependent or mean-field models, under super-linear growth conditions for both the…
We study the numerical approximation of a class of degenerate parabolic stochastic partial differential equations on non-compact metric graphs, which naturally arise in the asymptotic analysis of Hamiltonian flows under small noise…
This paper explores numerical methods for solving a convex differentiable semi-infinite program. We introduce a primal-dual gradient method which performs three updates iteratively: a momentum gradient ascend step to update the constraint…
Motivated by the modeling of the temporal structure of the velocity field in a highly turbulent flow, we propose and study a linear stochastic differential equation that involves the ingredients of a Ornstein-Uhlenbeck process, supplemented…
A number of optimization approaches have been proposed for optimizing nonconvex objectives (e.g. deep learning models), such as batch gradient descent, stochastic gradient descent and stochastic variance reduced gradient descent. Theory…
In this paper we present an enhancement of the regression-based variance reduction approaches recently proposed in Belomestny et al. This enhancement is based on a truncation of the control variate and allows for a significant reduction of…
In this paper we extend the well-known L-Shaped method to solve two-stage stochastic programming problems with decision-dependent uncertainty. The method is based on a novel, unifying, formulation and on distribution-specific optimality and…
(Mini-batch) Stochastic Gradient Descent is a popular optimization method which has been applied to many machine learning applications. But a rather high variance introduced by the stochastic gradient in each step may slow down the…
In this work we study a multi-step scheme on time-space grids proposed by W. Zhao et al. [28] for solving backward stochastic differential equations, where Lagrange interpolating polynomials are used to approximate the time-integrands with…
A stochastic gradient method for finite-sum minimization subject to deterministic linear constraints is proposed and analyzed. The procedure presented adapts the projected gradient method on convex set to the use of both a stochastic…
Initiated around the year 2007, the Malliavin-Stein approach to probabilistic approximations combines Stein's method with infinite-dimensional integration by parts formulae based on the use of Malliavin-type operators. In the last decade,…
We describe stochastic Newton and stochastic quasi-Newton approaches to efficiently solve large linear least-squares problems where the very large data sets present a significant computational burden (e.g., the size may exceed computer…
Stochastic approximation algorithm is a useful technique which has been exploited successfully in probability theory and statistics for a long time. The step sizes used in stochastic approximation are generally taken to be deterministic and…
This paper considers stochastic subgradient mirror-descent method for solving constrained convex minimization problems. In particular, a stochastic subgradient mirror-descent method with weighted iterate-averaging is investigated and its…
Decentralized optimization on Riemannian manifolds is foundational for many modern machine learning and signal processing applications in which data are non-Euclidean and generated and processed in a distributed manner. Although intrinsic…
Stochastic versions of proximal methods have gained much attention in statistics and machine learning. These algorithms tend to admit simple, scalable forms, and enjoy numerical stability via implicit updates. In this work, we propose and…
Motivated by their broad applications in reinforcement learning, we study the linear two-time-scale stochastic approximation, an iterative method using two different step sizes for finding the solutions of a system of two equations. Our…
This paper addresses the challenging numerical simulation of nonlinear hybrid stochastic functional differential equations with infinite delays. We first propose an explicit scheme using space and time truncation, requiring only finite…
We propose a method to compute an approximation of the moments of a discrete-time stochastic polynomial system. We use the Carleman linearization technique to transform this finite-dimensional polynomial system into an infinite-dimensional…