Decomposition of Big Tensors With Low Multilinear Rank

MaRDI QIDQ6511581arXivFDO

Authors Guoxu Zhou, Andrzej Cichocki, Shengli Xie

Published in arXiv

Abstract: Tensor decompositions are promising tools for big data analytics as they bring multiple modes and aspects of data to a unified framework, which allows us to discover complex internal structures and correlations of data. Unfortunately most existing approaches are not designed to meet the major challenges posed by big data analytics. This paper attempts to improve the scalability of tensor decompositions and provides two contributions: A flexible and fast algorithm for the CP decomposition (FFCP) of tensors based on their Tucker compression; A distributed randomized Tucker decomposition approach for arbitrarily big tensors but with relatively low multilinear rank. These two algorithms can deal with huge tensors, even if they are dense. Extensive simulations provide empirical evidence of the validity and efficiency of the proposed algorithms.

Cited in

(2)

• Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation
• Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition

This page was built for publication: Decomposition of Big Tensors With Low Multilinear Rank

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