arXiv Machine Learning By Haoming Wang, Ming Yuan

Identifiability of Nonnegative Tensor Decompositions via Positive Scattering

Read the original on arXiv Machine Learning →

arXiv:2609. 11606v1 Announce Type: cross Abstract: Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Sep 10

Identifiability of Nonnegative Tensor Decompositions via Positive Scattering

The paper introduces a new concept called positive scattering to enhance identifiability of nonnegative tensor decompositions. By combining this scattering term with existing dimension-based conditions, the authors derive two sufficient criteria that guarantee minimality, nonnegative rank, and uniqueness for subsets of components. The key result is a positive splitting inequality that links dimension constraints with support-induced geometric rigidity, and the authors show that the scattering term’s mode costs are discrete, enabling an exact activation characterization via graph connectivity. This criterion can certify sparse nonnegative tensor decompositions that elude traditional Kruskal and Lovitz–Petrov conditions, even after reshaping, and reduces to familiar matrix results in the two-dimensional case.