Pith. sign in

REVIEW 1 cited by

Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.11092 v1 pith:RNDMAAJ5 submitted 2024-06-16 cs.LG cs.NAmath.NAstat.ML

classification cs.LGcs.NAmath.NAstat.ML
keywords samplingtensorcompletiont-ccst-curalgorithmbernoulliflexibility
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While Bernoulli sampling is extensively studied in tensor completion, t-CUR sampling approximates low-tubal-rank tensors via lateral and horizontal subtensors. However, both methods lack sufficient flexibility for diverse practical applications. To address this, we introduce Tensor Cross-Concentrated Sampling (t-CCS), a novel and straightforward sampling model that advances the matrix cross-concentrated sampling concept within a tensor framework. t-CCS effectively bridges the gap between Bernoulli and t-CUR sampling, offering additional flexibility that can lead to computational savings in various contexts. A key aspect of our work is the comprehensive theoretical analysis provided. We establish a sufficient condition for the successful recovery of a low-rank tensor from its t-CCS samples. In support of this, we also develop a theoretical framework validating the feasibility of t-CUR via uniform random sampling and conduct a detailed theoretical sampling complexity analysis for tensor completion problems utilizing the general Bernoulli sampling model. Moreover, we introduce an efficient non-convex algorithm, the Iterative t-CUR Tensor Completion (ITCURTC) algorithm, specifically designed to tackle the t-CCS-based tensor completion. We have intensively tested and validated the effectiveness of the t-CCS model and the ITCURTC algorithm across both synthetic and real-world datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    stat.ML 2026-08 conditional novelty 6.0 of 10

    R-ItCUR is an iterative t-CUR algorithm that completes low-tubal-rank tensors from cross-concentrated samples corrupted by sparse outliers, using Welsch robust correction and blockwise projected gradient descent.

Pith tools