Uniqueness of Nonnegative Tensor Approximations

DOI10.1109/TIT.2016.2532906MaRDI QIDQ2976938zbMATH OpenOpenAlexFDO

Authors Yang Qi, Pierre Comon, Lek-Heng Lim

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.8129

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We show that for a nonnegative tensor, a best nonnegative rank-r approximation is almost always unique, its best rank-one approximation may always be chosen to be a best nonnegative rank-one approximation, and that the set of nonnegative tensors with non-unique best rank-one approximations form an algebraic hypersurface. We show that the last part holds true more generally for real tensors and thereby determine a polynomial equation so that a real or nonnegative tensor which does not satisfy this equation is guaranteed to have a unique best rank-one approximation. We also establish an analogue for real or nonnegative symmetric tensors. In addition, we prove a singular vector variant of the Perron--Frobenius Theorem for positive tensors and apply it to show that a best nonnegative rank-r approximation of a positive tensor can never be obtained by deflation. As an aside, we verify that the Euclidean distance (ED) discriminants of the Segre variety and the Veronese variety are hypersurfaces and give defining equations of these ED discriminants.

Cited in

(18)

• A very brief introduction to nonnegative tensors from the geometric viewpoint
• Hyperspectral image classification based on mathematical morphology and tensor decomposition
• Asymptotics of degrees and ED degrees of Segre products
• Standard tensor and its applications in problem of singular values of tensors
• Semialgebraic geometry of nonnegative tensor rank
• Nonnegative Tensor Cofactorization and Its Unified Solution
• Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers
• On Koopman mode decomposition and tensor component analysis
• Three hypergraph eigenvector centralities
• Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
• Best nonnegative rank-one approximations of tensors
• Algorithms for structure preserving best rank-one approximations of partially symmetric tensors
• Tensor norms on ordered normed spaces, polarization constants, and exchangeable distributions
• Improved uniqueness conditions of solution for multilinear pagerank and its application
• Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
• Relaxation of the rank-1 tensor approximation using different norms
• Generating hidden Markov models from process models through nonnegative tensor factorization
• A modified spectral projected gradient method for tensor approximations over closed convex sets

This page was built for publication: Uniqueness of Nonnegative Tensor Approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976938)