Matrix Product State for Higher-Order Tensor Compression and Classification

DOI10.1109/TSP.2017.2703882MaRDI QIDQ4621783zbMATH OpenOpenAlexFDO

Authors Johann A. Bengua, Phien N. Ho, Minh N. do, Hoang Duong Tuan

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.04541

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: This paper introduces matrix product state (MPS) decomposition as a new and systematic method to compress multidimensional data represented by higher-order tensors. It solves two major bottlenecks in tensor compression: computation and compression quality. Regardless of tensor order, MPS compresses tensors to matrices of moderate dimension which can be used for classification. Mainly based on a successive sequence of singular value decompositions (SVD), MPS is quite simple to implement and arrives at the global optimal matrix, bypassing local alternating optimization, which is not only computationally expensive but cannot yield the global solution. Benchmark results show that MPS can achieve better classification performance with favorable computation cost compared to other tensor compression methods.

This page was built for publication: Matrix Product State for Higher-Order Tensor Compression and Classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621783)