TL;DR
This paper reveals that the signature kernel for sequential data solves a Goursat PDE, enabling efficient computation and GPU parallelization, with extensions to rough paths and empirical validation in machine learning tasks.
Contribution
It establishes a novel connection between the signature kernel and Goursat PDEs, providing an efficient PDE-based kernel computation method and extending analysis to rough paths.
Findings
PDE-based signature kernel can be computed efficiently using hyperbolic PDE solvers.
The method is well-suited for GPU parallelization, reducing computational complexity.
Empirical results demonstrate the kernel's effectiveness in machine learning applications.
Abstract
Recently, there has been an increased interest in the development of kernel methods for learning with sequential data. The signature kernel is a learning tool with potential to handle irregularly sampled, multivariate time series. In "Kernels for sequentially ordered data" the authors introduced a kernel trick for the truncated version of this kernel avoiding the exponential complexity that would have been involved in a direct computation. Here we show that for continuously differentiable paths, the signature kernel solves a hyperbolic PDE and recognize the connection with a well known class of differential equations known in the literature as Goursat problems. This Goursat PDE only depends on the increments of the input sequences, does not require the explicit computation of signatures and can be solved efficiently using state-of-the-arthyperbolic PDE numerical solvers, giving a kernel…
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.
