Bilinear factorizations subject to monomial equality constraints via tensor decompositions

The Canonical Polyadic Decomposition (CPD), which decomposes a tensor into a sum of rank one terms, plays an important role in signal processing and machine learning. In this paper we extend the CPD framework to the more general case of bilinear factorizations subject to monomial equality constraints. This includes extensions of multilinear algebraic uniqueness conditions originally developed for the CPD. We obtain a deterministic uniqueness condition that admits a constructive interpretation. Computationally, we reduce the bilinear factorization problem into a CPD problem, which can be solved via a matrix EigenValue Decomposition (EVD). Under the given conditions, the discussed EVD-based algorithms are guaranteed to return the exact bilinear factorization. Finally, we make a connection between bilinear factorizations subject to monomial equality constraints and the coupled block term decomposition, which allows us to translate monomial structures into low-rank structures.