TL;DR
This paper introduces efficient algorithms for computing the Volterra signature, a generalization of the path signature with matrix-valued kernels, addressing computational challenges and providing practical implementations.
Contribution
It develops novel algorithms with various complexity optimizations for the Volterra signature and releases an open-source package implementing these methods.
Findings
Quadratic complexity $O(J^2)$ for general approximation scheme
FFT-based acceleration reduces complexity to $O(J ext{log} J)$
Exact recursion achieves $O(JR^2)$ complexity for certain kernels
Abstract
The Volterra signature extends the classical path signature by incorporating general matrix-valued kernel into its iterated integral structure, yielding a flexible notion of memory for time series. Its components can be viewed as successive Picard iterates of linear controlled Volterra equations, making their exact computation of additional mathematical interest. However, the kernel introduces substantial algorithmic challenges. We provide a resolution by first decomposing the Chen-type convolution relation established in [arXiv:2603.04525] into analytic and arithmetic parts, and then introducing several efficient algorithms: a general approximative scheme with quadratic complexity in the number of time steps , an FFT-based acceleration with complexity for convolution kernels on uniform grids, and an exact recursion with complexity for kernels…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
