arXiv (All)
open access
A Practical Mode-parallel Implementation of the (H-)Tucker Decomposition via Randomization
In the last decades, tensors have emerged as the right tool to represent multidimensional data in a compact yet informative manner. Moreover, it is well-known that by performing low-rank factorizations of such tensors one is often able to effectively unveil possible hidden structure in data, mainly
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
- A Practical Mode-parallel Implementation of the (H-)Tucker Decomposition via Randomization#789604
- Low Rank Tensor Completion via Adaptive ADMM#155305
- Tensor Completion using Subspace Information#1050674
- Adaptive Subspace Modeling With Functional Tucker Decomposition#1104991
- On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery#1131379
Record · ID 793608
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