arXiv (All)
open access
Identifiability of Nonnegative Tensor Decompositions via Positive Scattering
Identifiability of tensor decompositions is often established through linear-algebraic conditions on the factor families. For nonnegative decompositions, however, positivity provides additional information that is not captured by dimension and independence alone: nonnegative terms cannot cancel, and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Farness Preserving Non-Negative Matrix Factorization#322226
- ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings#677415
- ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings#674218
- Low Rank Tensor Completion via Adaptive ADMM#155305
- Equivalence of Fixed-Rank and Rank-One Even-Order Symmetric Tensor Factorization#975044
Record · ID 999123
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive