pith. sign in

arxiv: 2006.00873 · v2 · pith:SRU3A5QPnew · submitted 2020-06-01 · 💻 cs.LG · stat.ML

A Generalised Signature Method for Multivariate Time Series Feature Extraction

classification 💻 cs.LG stat.ML
keywords methodsignaturemakemultivariateseriestimeapplicationchoices
0
0 comments X
read the original abstract

The 'signature method' refers to a collection of feature extraction techniques for multivariate time series, derived from the theory of controlled differential equations. There is a great deal of flexibility as to how this method can be applied. On the one hand, this flexibility allows the method to be tailored to specific problems, but on the other hand, can make precise application challenging. This paper makes two contributions. First, the variations on the signature method are unified into a general approach, the \emph{generalised signature method}, of which previous variations are special cases. A primary aim of this unifying framework is to make the signature method more accessible to any machine learning practitioner, whereas it is now mostly used by specialists. Second, and within this framework, we derive a canonical collection of choices that provide a domain-agnostic starting point. We derive these choices as a result of an extensive empirical study on 26 datasets and go on to show competitive performance against current benchmarks for multivariate time series classification. Finally, to ease practical application, we make our techniques available as part of the open-source [redacted] project.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Signature Approach for Contextual Bandits with Nonlinear and Path-dependent Rewards

    cs.LG 2026-05 conditional novelty 7.0

    Signature transforms approximate path-dependent nonlinear rewards as linear functionals, enabling the DisSigUCB algorithm with a high-probability regret bound of order O(sqrt((d+m)KT)).

  2. Soft-MSM: Differentiable Context-Aware Elastic Alignment for Time Series

    cs.LG 2026-04 unverdicted novelty 7.0

    Soft-MSM is a smooth, gradient-enabled version of the context-aware MSM distance for time series alignment that outperforms Soft-DTW alternatives in clustering and nearest-centroid classification.

  3. Online Goal Recognition using Path Signature and Dynamic Time Warping

    cs.AI 2026-05 unverdicted novelty 6.0

    Path signatures combined with dynamic time warping enable more accurate and efficient online goal recognition than prior state-of-the-art methods in continuous domains.