mlsanityData to 14 Oct 2026

Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling

arXiv 2608.03928 ↗First posted 4 Aug 2026stat.ML cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Tensor cross-concentrated sampling (t-CCS) bridges entrywise sampling and t-CUR slice-wise sampling by observing entries only within selected horizontal and lateral slices. Existing t-CCS completion methods, however, assume that the observations are free of gross corruption. In this work, we study robust recovery of a third-order low-tubal-rank tensor from partial t-CCS observations contaminated by sparse, arbitrarily large outliers. We propose Robust Iterative t-CUR (R-ItCUR), a tensor-native algorithm that partitions the sampled tensor cross into two exterior blocks and an intersection block, applies adaptive blockwise Welsch correction for outlier suppression, and updates the low-rank component through projected blockwise gradient descent. By operating directly on the sampled cross, R-ItCUR avoids reconstructing the full tensor throughout the iterations, resulting in substantial memory and computational savings. Experiments on synthetic tensors, cardiac MRI data, and three-dimensional seismic data demonstrate accurate recovery and strong robustness to sparse gross corruptions. The results further highlight the importance of explicitly exploiting the cross-concentrated sampling structure in robust tensor completion.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 51 references that are in the map. First posted on arXiv 4 Aug 2026.

Builds on

27 of 51 references.

References · 27

  1. 2021The Medical Segmentation Decathloncited by 628
  2. 2019A large annotated medical image dataset for the development and evaluation of segmentation algorithmscited by 373
  3. 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 112
  4. 2020Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descentcited by 71
  5. 2015Exact tensor completion using t-SVDcited by 70
  6. 2014Novel methods for multilinear data completion and de-noising based on tensor-SVDcited by 56
  7. 2014Non-convex Robust PCAcited by 41
  8. 2016Fast Algorithms for Robust PCA via Gradient Descentcited by 39
  9. 2013Robust Low-rank Tensor Recovery: Models and Algorithmscited by 34
  10. 2021Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detectioncited by 34
  11. 2017Weighted Low-rank Tensor Recovery for Hyperspectral Image Restorationcited by 30
  12. 2017Accelerated Alternating Projections for Robust Principal Component Analysiscited by 25
15 more
  1. 2014Bayesian Robust Tensor Factorization for Incomplete Multiway Datacited by 22
  2. 2013Robust Spectral Compressed Sensing via Structured Matrix Completioncited by 13
  3. 2016Nearly-optimal Robust Matrix Completioncited by 13
  4. 2021Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositionscited by 13
  5. 2022Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Samplingcited by 12
  6. 2022Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completioncited by 11
  7. 2023Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptioncited by 11
  8. 2020Robust Low-tubal-rank Tensor Completion based on Tensor Factorization and Maximum Correntopy Criterioncited by 6
  9. 2024On the Robustness of Cross-Concentrated Sampling for Matrix Completioncited by 5
  10. 2024Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recoverycited by 4
  11. 2024Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descentcited by 3
  12. 2024Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completioncited by 3
  13. 2024Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recoverycited by 3
  14. 2024Optimal Matrix-Mimetic Tensor Algebras via Variable Projectioncited by 2
  15. 2025Guaranteed Nonconvex Low-Rank Tensor Estimation via Scaled Gradient Descentcited by 2

Built on by

Not cited yet.