arXiv (All)
open access
On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery
In this paper, we take a step towards developing efficient hard thresholding methods for low-rank tensor recovery from memory-efficient linear measurements with tensorial structure. Theoretical guarantees for many standard iterative low-rank recovery methods, such as iterative hard thresholding (IHT
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
- Low Rank Tensor Completion via Adaptive ADMM#155305
- A Practical Mode-parallel Implementation of the (H-)Tucker Decomposition via Randomization#793608
- A Practical Mode-parallel Implementation of the (H-)Tucker Decomposition via Randomization#789604
- Identifiability of Nonnegative Tensor Decompositions via Positive Scattering#673526
- Tensor Completion using Subspace Information#1050674
Record · ID 1131379
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