Pith. sign in

REVIEW 1 cited by

Unsupervised Scalable Representation Learning for Multivariate Time Series

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1901.10738 v4 pith:JI2GLRLQ submitted 2019-01-30 cs.LG cs.NEstat.ML

classification cs.LGcs.NEstat.ML
keywords seriestimelearninglengthmultivariaterepresentationsscalableunsupervised
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Time series constitute a challenging data type for machine learning algorithms, due to their highly variable lengths and sparse labeling in practice. In this paper, we tackle this challenge by proposing an unsupervised method to learn universal embeddings of time series. Unlike previous works, it is scalable with respect to their length and we demonstrate the quality, transferability and practicability of the learned representations with thorough experiments and comparisons. To this end, we combine an encoder based on causal dilated convolutions with a novel triplet loss employing time-based negative sampling, obtaining general-purpose representations for variable length and multivariate time series.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. ST-Tree with Interpretability for Multivariate Time Series Classification

    cs.LG 2024-11 conditional novelty 4.0 of 10

    ST-Tree couples a Swin Transformer feature extractor with a prototype-based neural tree, reporting average accuracy of 0.789 on 10 UEA multivariate time series datasets, with visualizations of node prototypes as evide...

Pith tools