2018
DOI: 10.48550/arxiv.1802.08252
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The iisignature library: efficient calculation of iterated-integral signatures and log signatures

Abstract: Iterated-integral signatures and log signatures are vectors calculated from a path that characterise its shape. They come from the theory of differential equations driven by rough paths, and also have applications in statistics and machine learning. We present algorithms for efficiently calculating these signatures, and benchmark their performance. We release the methods as a Python package.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 9 publications
(18 reference statements)
0
14
0
Order By: Relevance
“…We note that the signature and the signature kernel can be easily computed on real time series using existing python libraries (Lyons, 2010;Reizenstein & Graham, 2018).…”
Section: Variational Orthogonal Signature Featuresmentioning
confidence: 99%
“…We note that the signature and the signature kernel can be easily computed on real time series using existing python libraries (Lyons, 2010;Reizenstein & Graham, 2018).…”
Section: Variational Orthogonal Signature Featuresmentioning
confidence: 99%
“…In terms of applications, some examples where the signature method has seen use include character recognition (Yang et al, 2016a,b;Reizenstein, 2019;Toth and Oberhauser, 2019), human action recognition (Li et al, 2017;Yang et al, 2017;Liao et al, 2019), and medicine (Arribas et al, 2018;Morrill et al, 2019;Howison et al, 2020). These applications have also prompted the creation of high performance software (Reizenstein and Graham, 2018;Kidger and Lyons, 2020).…”
Section: Related Workmentioning
confidence: 99%
“…, x n , where x contains n observations, and the ith observation x i , i ∈ [n], is assumed to be a d-dimensional column vector at the ith time point, one needs to convert it to a continuous R d -valued path via piecewise linear interpolation or other transforms in order to compute signature. The availability of Python packages iisignature [19] and esig allows easy calculation of signature, where the linear interpolation is implemented automatically by the packages.…”
Section: Signature Featuresmentioning
confidence: 99%
“…To ensure comparability of our results, we predicted raw ASRM/QIDS scores. For our own comparison, we also made more coarse-grained predictions according to the categories for QIDS: none (1-5), mild (6-10), moderate (11)(12)(13)(14)(15), severe (16)(17)(18)(19)(20) and very severe (21)(22)(23)(24)(25)(26)(27) [20], and for ASRM: none (0-5), mild (6)(7)(8)(9), moderate (10)(11)(12)(13), severe (14)(15)(16)(17) and very severe (17)(18)(19)(20).…”
Section: Score Predictionmentioning
confidence: 99%