Optimal approximation of stochastic integrals in analytic noise model

Abstract

We study approximate stochastic Itô integration of processes belonging to a class of progressively measurable stochastic processes that are Hölder continuous in the $r$th mean. Inspired by increasingly popularity of computations with low precision (used on Graphics Processing Units -- GPUs and standard Computer Processing Units -- CPU for significant speedup), we introduce a suitable analytic noise model of standard noisy information about $X$ and $W$. In this model we show that the upper bounds on the error of the Riemann-Maruyama quadrature are proportional to $n^{-\varrho }+{\delta }_1+{\delta }_2$, where $n$ is a number of noisy evaluations of $X$ and $W$, $\varrho \in (0,1]$ is a Hölder exponent of $X$, and ${\delta }_1,{\delta }_2\ge 0$ are precision parameters for values of $X$ and $W$, respectively. Moreover, we show that the error of any algorithm based on at most $n$ noisy evaluations of $X$ and $W$ is at least $C(n^{-\varrho }+{\delta }_1)$. Finally, we report numerical experiments performed on both CPU and GPU, that confirm our theoretical findings, together with some computational performance comparison between those two architectures.

Cited by in corpus (4)

• Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information
• Efficient approximation of SDEs driven by countably dimensional Wiener process and Poisson random measure
• Randomized Runge-Kutta method -- stability and convergence under inexact information
• Euler scheme for approximation of solution of nonlinear ODEs under inexact information