Related papers: Convex ordering for stochastic Volterra equations …
This paper provides a theoretical and numerical comparison of classical first-order splitting methods for solving smooth convex optimization problems and cocoercive equations. From a theoretical point of view, we compare convergence rates…
In this article, we investigate the method of upper and lower solutions for Volterra integral equation of the first kind on arbitrary time scale $\mathbb{T}$. We establish some existence results in a certain sector. Moreover, monotone…
It is known from the monograph [1, Chapter 5] that the weak convergence analysis of numerical schemes for stochastic Maxwell equations is an unsolved problem. This paper aims to fill the gap by establishing the long-time weak convergence…
When the nonconvex problem is complicated by stochasticity, the sample complexity of stochastic first-order methods may depend linearly on the problem dimension, which is undesirable for large-scale problems. To alleviate this linear…
We propose a new theoretical framework that exploits convolution kernels to transform a Volterra-type path-dependent (non-Markovian) stochastic process into a standard (Markovian) diffusion process. Remarkably, it is also possible to go…
In this paper, we propose a multilevel stochastic framework for the solution of nonconvex unconstrained optimization problems. The proposed approach uses random regularized first-order models that exploit an available hierarchical…
We provide a unified treatment of pathwise Large and Moderate deviations principles for a general class of multidimensional stochastic Volterra equations with singular kernels, not necessarily of convolution form. Our methodology is based…
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they…
Weakly singular Volterra integral equations of the different types are considered. The construction of accuracy-optimal numerical methods for one-dimensional and multidimensional equations is discussed. Since this question is closely…
Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the…
The existence of weak solutions is established for stochastic Volterra equations with time-inhomogeneous coefficients allowing for general kernels in the drift and convolutional or bounded kernels in the diffusion term. The presented…
Using an optimization algorithm to solve a machine learning problem is one of mainstreams in the field of science. In this work, we demonstrate a comprehensive comparison of some state-of-the-art first-order optimization algorithms for…
In the paper regularity of solutions to stochastic Volterra equations in a separable Hilbert space is studied. Sufficient conditions for the temporal and spatial regularity of stochastic convolutions corresponding to the equations under…
It is well known that the Euler method for a random ordinary differential equation $\mathrm{d}X_t/\mathrm{d}t = f(t, X_t, Y_t)$ driven by a stochastic process $\{Y_t\}_t$ with $\theta$-H\"older sample paths is estimated to be of strong…
In recent years, the success of deep learning has inspired many researchers to study the optimization of general smooth non-convex functions. However, recent works have established pessimistic worst-case complexities for this class…
Gradient-free/zeroth-order methods for black-box convex optimization have been extensively studied in the last decade with the main focus on oracle calls complexity. In this paper, besides the oracle complexity, we focus also on iteration…
In this paper we study convex bi-level optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the…
In this text matrix Volterra integral equation of the first kind is addressed. It is assumed that kernels of the equation have jump discontinuities on non-intersecting curves. Such equations appear in the theory of evolving dynamic systems.…
The convergence of the first order Euler scheme and an approximative variant thereof, along with convergence rates, are established for rough differential equations driven by c\`adl\`ag paths satisfying a suitable criterion, namely the…
In this paper we investigate two numerical schemes for the simulation of stochastic Volterra equations driven by space--time L\'evy noise of pure-jump type. The first one is based on truncating the small jumps of the noise, while the second…