English

Seq2Tens: An Efficient Representation of Sequences by Low-Rank Tensor Projections

Machine Learning 2021-08-02 v2 Machine Learning

Abstract

Sequential data such as time series, video, or text can be challenging to analyse as the ordered structure gives rise to complex dependencies. At the heart of this is non-commutativity, in the sense that reordering the elements of a sequence can completely change its meaning. We use a classical mathematical object -- the tensor algebra -- to capture such dependencies. To address the innate computational complexity of high degree tensors, we use compositions of low-rank tensor projections. This yields modular and scalable building blocks for neural networks that give state-of-the-art performance on standard benchmarks such as multivariate time series classification and generative models for video.

Keywords

Cite

@article{arxiv.2006.07027,
  title  = {Seq2Tens: An Efficient Representation of Sequences by Low-Rank Tensor Projections},
  author = {Csaba Toth and Patric Bonnier and Harald Oberhauser},
  journal= {arXiv preprint arXiv:2006.07027},
  year   = {2021}
}

Comments

37 pages, 6 figures, 8 tables

R2 v1 2026-06-23T16:16:05.070Z