Performance of Rank-One Tensor Approximation on Incomplete Data

Hugo Lebeau
4/10/2025
stat.MLcs.LGmath.PR

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

We are interested in the estimation of a rank-one tensor signal when only a portion $\varepsilon$ of its noisy observation is available. We show that the study of this problem can be reduced to that of a random matrix model whose spectral analysis gives access to the reconstruction performance. These results shed light on and specify the loss of performance induced by an artificial reduction of the memory cost of a tensor via the deletion of a random part of its entries.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Adaptive Higher-order Spectral Estimators

82% match2015

Low-Rank Tucker Approximation of a Tensor From Streaming Data

80% match1 repo72019

Performance Gaps in Multi-view Clustering under the Nested Matrix-Tensor Model

80% match2024

Spectral gap-based deterministic tensor completion

80% match2023

On the Accuracy of Hotelling-Type Asymmetric Tensor Deflation: A Random Tensor Analysis

80% match2023

Tensor Train Completion from Fiberwise Observations Along a Single Mode

79% match2025

Cite this paper

@article{lebeau2025performance,
  title  = {Performance of Rank-One Tensor Approximation on Incomplete Data},
  author = {Hugo Lebeau},
  year   = {2025},
  eprint = {2504.07818},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.07818v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.07818.svg)](https://codeofpaper.com/paper/2504.07818)

Discussion