arXiv · 2611.16087
Convergence rates for truncated and discretised signature expansions
Abstract
Linear expansions in Brownian Stratonovich signatures, which originate in stochastic Taylor expansions, are increasingly used to represent and model processes with memory. Their numerical use requires truncating the signature at a level $M$ and discretising the driving path along $N$ steps. Under a simple growth condition on the coefficients of the linear expansion, we establish strong and weak convergence rates for both approximations, uniformly in time. The strong truncation error decays like $(B^M/(M!)^\varepsilon)^a$ for some constant $B$, uniformly in $N$, where $\varepsilon$ measures the growth of the coefficients and $a$ the regularity of the test function; the weak error does not improve on it. The discretisation error is of order $N^{-a/2}$ in $L^p$, and $N^{-1}$ weakly for polynomial test functions, uniformly in $M$. All these rates are sharp for polynomial test functions, and $M$, $N$ can be chosen independently. We extend the estimates to errors in probability, on distribution functions and on risk measures, and illustrate them on stochastic delay equations, Volterra processes and option pricing in signature volatility models.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Eduardo Abi Jaber, Dorinel Bastide, Ronan Pécheul, Clément Rey. 2026-11-11. Convergence rates for truncated and discretised signature expansions. https://searcharxiv.com/abs/2611.16087
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.