SOURCE-LINKED INTELLIGENCE

Tensor Completion using Subspace Information

arXiv · AI, language, vision and robotics · article · Sep 21, 2026 · UTC

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-computational gap in highly missing regimes. Fortunately, in many practical scenarios, side information is available, which can provide valuable insights to mitigate these challenges. In this paper, we introduce an algorithm called Tensor Completion using Subspace Information (TCSI) that incorporates side

Read original source ↗ Open in workspace

recordType

paper

region

Global