Lower Bound on Tensor Rank

Published: Sep 12, 2019
Abstract
Tensors and tensor decompositions are natural tools to analyse datasets of high dimensionality and variety, with a pillar of tensor decompositions being the Canonical Polyadic Decomposition (CPD). While the notion of CPD is closely intertwined with that of tensor rank, R unlike the matrix rank, the computation of tensor rank is as NP-hard problem, with an associated computational burden on the CPD. To address this issue, we derive a lower...
Paper Details
Title
Lower Bound on Tensor Rank
Published Date
Sep 12, 2019
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.