NALGAPFeb 12, 2025

Numerical Schemes for Signature Kernels

arXiv:2502.08470v15 citationsh-index: 3Has CodeSIAM J Numer Anal
Originality Incremental advance
AI Analysis

This work addresses a computational bottleneck for researchers and practitioners using kernel methods on high-frequency sequential data, offering a scalable and efficient solution.

The paper tackles the challenge of accurately and stably computing signature kernels for sequential data, particularly with highly oscillatory inputs, by introducing two advanced numerical schemes based on polynomial representations, achieving improvements of several orders of magnitude in mean absolute percentage error compared to traditional finite difference methods without increasing computational complexity.

Signature kernels have emerged as a powerful tool within kernel methods for sequential data. In the paper "The Signature Kernel is the solution of a Goursat PDE", the authors identify a kernel trick that demonstrates that, for continuously differentiable paths, the signature kernel satisfies a Goursat problem for a hyperbolic partial differential equation (PDE) in two independent time variables. While finite difference methods have been explored for this PDE, they face limitations in accuracy and stability when handling highly oscillatory inputs. In this work, we introduce two advanced numerical schemes that leverage polynomial representations of boundary conditions through either approximation or interpolation techniques, and rigorously establish the theoretical convergence of the polynomial approximation scheme. Experimental evaluations reveal that our approaches yield improvements of several orders of magnitude in mean absolute percentage error (MAPE) compared to traditional finite difference schemes, without increasing computational complexity. Furthermore, like finite difference methods, our algorithms can be GPU-parallelized to reduce computational complexity from quadratic to linear in the length of the input sequences, thereby improving scalability for high-frequency data. We have implemented these algorithms in a dedicated Python library, which is publicly available at: https://github.com/FrancescoPiatti/polysigkernel.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes