Tensor network ranks
Ke Ye, Lek-Heng Lim

TL;DR
This paper introduces a generalized concept of tensor network ranks based on undirected graphs, showing that many high-rank objects can have low $G$-rank, which broadens the applicability of low-rank approximations.
Contribution
It proposes a new framework for tensor ranks using graph-based notions, unifying and extending classical rank concepts and tensor network states.
Findings
$G$-rank can be exponentially lower than classical rank.
Many tensors have low $G$-rank despite high classical rank.
The framework applies to functions, matrices, and tensors across disciplines.
Abstract
In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor (which we will see are all the same object in this context) has \emph{low rank} may be ill-justified. There are many natural instances where the object in question has high rank with respect to the classical notions of rank: matrix rank, tensor rank, multilinear rank --- the latter two being the most straightforward generalizations of the former. To remedy this, we show that one may vastly expand these classical notions of ranks: Given any undirected graph , there is a notion of -rank associated with , which provides us with as many different kinds of ranks as there are undirected graphs. In particular, the popular tensor network states in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Sparse and Compressive Sensing Techniques · Matrix Theory and Algorithms
