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.
arXiv:2610.32787v1 Announce Type: cross
Abstract: We study the structure and exact certification of nonnegative tensor decompositions supplied through rational factor matrices. Every failure of minim...
By Haoming Wang, Ming Yuan
arXiv:2602. 04795v3 Announce Type: replace Abstract: Nonnegative matrix factorization (NMF) is a popular data embedding technique.
By Olivier Vu Thanh, Nicolas Gillis
arXiv:2609.14307v1 Announce Type: new
Abstract: Low-rank tensor factorization provides a flexible framework for completing multidimensional data from incomplete and corrupted observations. However, u...
By Binghao Wang, Feng Zhang, Wendong Wang, Jianjun Wang
arXiv:2511. 07109v2 Announce Type: replace-cross Abstract: Nonnegative matrix factorization (NMF) is a linear dimensionality reduction technique for nonnegative data, with applications such as hyperspectral unmixing and topic modeling.
By Junjun Pan, Valentin Leplat, Michael Ng, Nicolas Gillis
arXiv:2606. 15679v1 Announce Type: cross Abstract: Stochastic trace estimation is a standard tool for approximating the trace of a large-scale matrix available only through matrix-vector products.
By Zvonimir Bujanovi\'c, Daniel Kressner, Hrvoje Oli\'c
The paper applies parameterised graph theory to tensor networks, showing that cutwidth and tree‑cutwidth bound the bond‑dimension overhead needed to represent a tensor‑network state as a matrix product state or tree tensor network. It derives graph‑dependent upper bounds on the sample and computational complexity of tensor‑network tomography, introducing a new graph parameter called learning complexity. Finally, it extends the framework to an agnostic learner that approximates any state with a tensor‑network state of given bond dimension, providing explicit graph‑dependent complexity bounds.
By Matthias C. Caro, Natalie McHugh, Sergii Strelchuk
arXiv:2609.09258v1 Announce Type: new
Abstract: We present a method for recovering the moral graph of a causal DAG from a probability distribution over discrete variables, using fully connected tenso...
By \'A. Troyano Olivas, Chi-Hang Fred Fung, Hans H. Brunner, Momtchil Peev, Vicente Martin
arXiv:2606. 04176v1 Announce Type: new Abstract: We study a distributional generalization of the matrix completion problem in which each entry of the target matrix is a probability distribution rather than a scalar.
By Jiayi Wang, Raymond K. W. Wong
arXiv:2610.27010v1 Announce Type: cross
Abstract: We study robust estimation of a Gaussian precision matrix that decomposes as a sparse matrix minus a symmetric, possibly indefinite, low-rank matrix,...
By Chuansen Peng, Xiaojing Shen
arXiv:2602. 05869v2 Announce Type: replace-cross Abstract: We introduce Wedge Sampling, a new non-adaptive sampling scheme for low-rank tensor completion.
By Hengrui Luo, Anna Ma, Ludovic Stephan, Yizhe Zhu
arXiv:2608. 08642v1 Announce Type: new Abstract: We study exact Kullback--Leibler (KL) projection for low-rank factorizations whose two nonnegative factors have prescribed row marginals and a shared, learned column marginal.
By Enliang Hu