Identifiability of Nonnegative Tucker Decompositions -- Part I: Theory
Subhayan Saha, Giovanni Barbarino, Nicolas Gillis

TL;DR
This paper investigates the conditions under which nonnegative Tucker decompositions are identifiable, extending matrix factorization results to tensor models, and proposes procedures for achieving uniqueness based on sparsity and rank conditions.
Contribution
It provides new theoretical identifiability results for nonnegative Tucker decompositions by adapting NMF conditions, and introduces procedures to ensure uniqueness using tensor unfoldings or slices.
Findings
Identifiability of nonnegative Tucker decompositions is achievable under sparsity and rank conditions.
Procedures using unfoldings or slices can be employed to obtain identifiable decompositions.
The core tensor's slices or unfoldings with full column rank are sufficient for uniqueness.
Abstract
Tensor decompositions have become a central tool in data science, with applications in areas such as data analysis, signal processing, and machine learning. A key property of many tensor decompositions, such as the canonical polyadic decomposition, is identifiability: the factors are unique, up to trivial scaling and permutation ambiguities. This allows one to recover the groundtruth sources that generated the data. The Tucker decomposition (TD) is a central and widely used tensor decomposition model. However, it is in general not identifiable. In this paper, we study the identifiability of the nonnegative TD (nTD). By adapting and extending identifiability results of nonnegative matrix factorization (NMF), we provide uniqueness results for nTD. Our results require the nonnegative matrix factors to have some degree of sparsity (namely, satisfy the separability condition, or the…
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.
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 · Model Reduction and Neural Networks
MethodsTuckER
