Related papers: A segment-wise dynamic programming algorithm for B…
The sequential minimal optimization (SMO) algorithm and variants thereof are the de facto standard method for solving large quadratic programs for support vector machine (SVM) training. In this paper we propose a simple yet powerful…
In this paper, a multilevel Monte Carlo theta EM scheme is provided for stochastic differential delay equations with small noise. Under a global Lipschitz condition, the variance of two coupled paths is derived. Then, the global Lipschitz…
We investigate the optimal structure of dynamic regression models used in multivariate time series prediction and propose a scheme to form the lagged variable structure called Backward-in-Time Selection (BTS) that takes into account…
This paper studies multi-level stochastic approximation algorithms. Our aim is to extend the scope of the multilevel Monte Carlo method recently introduced by Giles (Giles 2008) to the framework of stochastic optimization by means of…
In the stochastic gradient descent (SGD) for sequential simulations such as the neural stochastic differential equations, the Multilevel Monte Carlo (MLMC) method is known to offer better theoretical computational complexity compared to the…
In this paper, a class of stable explicit $\theta$-schemes are proposed for solving anticipated backward stochastic differential equations (anticipated BSDEs) which generator not only contains the present values of the solutions but also…
Stochastic Differential Equations (SDEs) in high dimension, having the structure of finite dimensional approximation of Stochastic Partial Differential Equations (SPDEs), are considered. The aim is to compute numerically expected values and…
We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the…
This work provides simple algorithms for multi-class (and multi-label) prediction in settings where both the number of examples n and the data dimension d are relatively large. These robust and parameter free algorithms are essentially…
In recent years dynamical systems (of deterministic and stochastic nature), describing many models in mathematics, physics, engineering and finances, become more and more complex. Numerical analysis narrowed only to deterministic algorithms…
This article deals with the numerical approximation of Markovian backward stochastic differential equations (BSDEs) with generators of quadratic growth with respect to $z$ and bounded terminal conditions. We first study a slight…
We describe an algorithm for dynamic load balancing of geometrically parallelized synchronous Monte Carlo simulations of physical models. This algorithm is designed for a (heterogeneous) multiprocessor system of the MIMD type with…
We introduce StoDCuP (Stochastic Dynamic Cutting Plane), an extension of the Stochastic Dual Dynamic Programming (SDDP) algorithm to solve multistage stochastic convex optimization problems. At each iteration, the algorithm builds lower…
Today's massively-sized datasets have made it necessary to often perform computations on them in a distributed manner. In principle, a computational task is divided into subtasks which are distributed over a cluster operated by a…
Sequence segmentation is a well-studied problem, where given a sequence of elements, an integer K, and some measure of homogeneity, the task is to split the sequence into K contiguous segments that are maximally homogeneous. A classic…
An efficient, joint transmission delay and channel parameter estimation algorithm is proposed for uplink asynchronous direct-sequence code-division multiple access (DS-CDMA) systems based on the space-alternating generalized expectation…
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 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…
This paper discusses several (sub)gradient methods attaining the optimal complexity for smooth problems with Lipschitz continuous gradients, nonsmooth problems with bounded variation of subgradients, weakly smooth problems with H\"older…
This paper is dedicated to the presentation and the analysis of a numerical scheme for forward-backward SDEs of the McKean-Vlasov type, or equivalently for solutions to PDEs on the Wasserstein space. Because of the mean field structure of…