mlsanityData to 7 Oct 2026

Tensor denoising and completion based on ordinal observations

arXiv 2002.06524 ↗First posted 16 Feb 2020stat.ML cs.LG math.STcited by 8

Not on the map. Why?

Abstract (arXiv)

Higher-order tensors arise frequently in applications such as neuroimaging, recommendation system, social network analysis, and psychological studies. We consider the problem of low-rank tensor estimation from possibly incomplete, ordinal-valued observations. Two related problems are studied, one on tensor denoising and the other on tensor completion. We propose a multi-linear cumulative link model, develop a rank-constrained M-estimator, and obtain theoretical accuracy guarantees. Our mean squared error bound enjoys a faster convergence rate than previous results, and we show that the proposed estimator is minimax optimal under the class of low-rank models. Furthermore, the procedure developed serves as an efficient completion method which guarantees consistent recovery of an order-K (d,ldots,d)-dimensional low-rank tensor using only tildeO(Kd) noisy, quantized observations. We demonstrate the outperformance of our approach over previous methods on the tasks of clustering and collaborative filtering.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 0; 2023: 3; 2024: 1; 2025: 1.

8 papers.