The signature kernel is the solution of a Goursat PDE
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 intr...
| Main Authors: | , , , , |
|---|---|
| Format: | Internet publication |
| Language: | English |
| Published: |
2020
|
| _version_ | 1797112976777412608 |
|---|---|
| author | Salvi, C Cass, T Foster, J Lyons, T Yang, W |
| author_facet | Salvi, C Cass, T Foster, J Lyons, T Yang, W |
| author_sort | Salvi, C |
| collection | OXFORD |
| description | 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 trick for the untruncated signature kernel, with the same raw complexity as the method from "Kernels for sequentially ordered data", but with the advantage that the PDE numerical scheme is well suited for GPU parallelization, which effectively reduces the complexity by a full order of magnitude in the length of the input sequences. In addition, we extend the previous analysis to the space of geometric rough paths and establish, using classical results from rough path theory, that the rough version of the signature kernel solves a rough integral equation analogous to the aforementioned Goursat PDE. Finally, we empirically demonstrate the effectiveness of our PDE kernel as a machine learning tool in various machine learning applications dealing with sequential data. We release the library sigkernel publicly available at this https URL. |
| first_indexed | 2024-04-09T03:56:32Z |
| format | Internet publication |
| id | oxford-uuid:fef93992-54ab-425a-b171-0e401ddce9d2 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-04-09T03:56:32Z |
| publishDate | 2020 |
| record_format | dspace |
| spelling | oxford-uuid:fef93992-54ab-425a-b171-0e401ddce9d22024-03-14T12:52:46ZThe signature kernel is the solution of a Goursat PDEInternet publicationhttp://purl.org/coar/resource_type/c_7ad9uuid:fef93992-54ab-425a-b171-0e401ddce9d2EnglishSymplectic Elements2020Salvi, CCass, TFoster, JLyons, TYang, WRecently, 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 trick for the untruncated signature kernel, with the same raw complexity as the method from "Kernels for sequentially ordered data", but with the advantage that the PDE numerical scheme is well suited for GPU parallelization, which effectively reduces the complexity by a full order of magnitude in the length of the input sequences. In addition, we extend the previous analysis to the space of geometric rough paths and establish, using classical results from rough path theory, that the rough version of the signature kernel solves a rough integral equation analogous to the aforementioned Goursat PDE. Finally, we empirically demonstrate the effectiveness of our PDE kernel as a machine learning tool in various machine learning applications dealing with sequential data. We release the library sigkernel publicly available at this https URL. |
| spellingShingle | Salvi, C Cass, T Foster, J Lyons, T Yang, W The signature kernel is the solution of a Goursat PDE |
| title | The signature kernel is the solution of a Goursat PDE |
| title_full | The signature kernel is the solution of a Goursat PDE |
| title_fullStr | The signature kernel is the solution of a Goursat PDE |
| title_full_unstemmed | The signature kernel is the solution of a Goursat PDE |
| title_short | The signature kernel is the solution of a Goursat PDE |
| title_sort | signature kernel is the solution of a goursat pde |
| work_keys_str_mv | AT salvic thesignaturekernelisthesolutionofagoursatpde AT casst thesignaturekernelisthesolutionofagoursatpde AT fosterj thesignaturekernelisthesolutionofagoursatpde AT lyonst thesignaturekernelisthesolutionofagoursatpde AT yangw thesignaturekernelisthesolutionofagoursatpde AT salvic signaturekernelisthesolutionofagoursatpde AT casst signaturekernelisthesolutionofagoursatpde AT fosterj signaturekernelisthesolutionofagoursatpde AT lyonst signaturekernelisthesolutionofagoursatpde AT yangw signaturekernelisthesolutionofagoursatpde |