arXiv (All)
open access
Tensor Completion using Subspace Information
Tensor completion has attracted significant attention in both applications and theoretical research. Under standard uniform sampling, existing polynomial-time guarantees generally require more observations than the number of degree of freedom, motivating the study of a possible statistical-to-comput
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
- M-Tensor Formalism: A Non-iterative High Dimensional Least Squares Regression for Nonlinear Models with Scarce Data#799955
- Adaptive Subspace Modeling With Functional Tucker Decomposition#1104991
Record · ID 1050674
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