arXiv (OAI Expanded)
open access
Beyond Kruskal: Polynomial-Time Tensor Decomposition under the Lovitz-Petrov Condition
Identifiability criteria certify that a given tensor decomposition is a unique rank decomposition. Kruskal's classical condition is one of the best-known deterministic criteria for identifiability. However, no polynomial-time decomposition algorithm is known under the Kruskal condition, and verifyin
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
- Effective algorithms for tensor train decomposition via the UTV framework#1117213
- Low-Rank Tensor Decompositions for the Theory of Neural Networks: Understanding deep learning through the lens of tensor formats#1203704
- Fast and Accurate CP-HIFI Tensor Decompositions: Exploiting Kronecker Structure#629952
- Fast and Accurate CP-HIFI Tensor Decompositions: Exploiting Kronecker Structure#628090
- Efficient Optimization of Tensor Rings with Low-Rank Environments#1234394
Record · ID 1210011
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