Pith. sign in

REVIEW 3 major objections 5 minor 51 references

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

T0 review · 3 major / 5 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read R-ItCUR, a tensor-native algorithm, recovers low-tubal-rank tensors from cross-concentrated samples under sparse gross corruption, working only on the observed slice blocks.

desk verdict A useful memory-efficient algorithm for robust t-CCS completion, but the experiments corrupt entrywise while the model assumes tube-wise sparsity, and that mismatch leaves the central claim under-supported. read the letter →

arxiv 2608.03928 v2 pith:PKVCVISD submitted 2026-08-04 stat.ML cs.ITcs.LGcs.NAmath.ITmath.NA

HanQin Cai , Longxiu Huang , Jing Qin , Chengyue Wu This is my paper · ORCID
classification stat.MLcs.ITcs.LGcs.NAmath.ITmath.NA MSC 15A6915A8365K1068T09
keywords tensorcompletiontubalrankt-CURdecompositioncross-concentratedsamplingsparseoutliersWelschlosst-productrobustrecovery
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks whether a third-order tensor of low tubal rank — meaning its frontal slices are low-rank matrices in the Fourier domain along the third mode — can still be recovered when observations are confined to a cross-concentrated sampling pattern (t-CCS), in which entries are seen only inside selected horizontal and lateral slices, and some of those observations are corrupted by sparse, arbitrarily large outliers. Its answer is yes, in the form of the R-ItCUR algorithm, which splits the sampled cross into three disjoint blocks, applies an adaptive blockwise Welsch correction to suppress outliers, and updates the low-rank component by projecting the exterior blocks onto subspaces taken from a rank-$r$ t-SVD of the intersection block. Because the algorithm keeps an implicit t-CUR representation, it never reconstructs the full tensor during the iterations, yielding substantial memory and computational savings. Experiments on synthetic tensors, cardiac MRI volumes, and three-dimensional seismic data show accurate recovery under corruption, with the robust version matching the nonrobust solver on clean data and outperforming full-tensor robust baselines under the same t-CCS observations.

What carries the argument

The load-bearing object is the t-CUR block decomposition of the sampled cross into three disjoint blocks — the horizontal exterior $X_{R'}$, the lateral exterior $X_{C'}$, and the intersection $X_U$ — together with the rank-$r$ truncated t-SVD of the intersection block, $X_U = W \ast \Theta \ast V^\top$, whose factors define tubal column and row subspaces onto which the exterior blocks are projected via $X_{R'} \leftarrow W \ast W^\top \ast \widetilde{X}_{R'}$ and $X_{C'} \leftarrow \widetilde{X}_{C'} \ast V \ast V^\top$. The second mechanism is the tube-wise $\alpha$-sparsity outlier model, whose support survives the Fourier transform unchanged, paired with the blockwise Welsch correction $W_\sigma(E) = (1 - \exp(-E \odot E / (2\sigma^2))) \odot E$, a smooth bounded robust loss whose scale $\sigma$ is read from the empirical $(1-\alpha)$-quantile of observed residual magnitudes. Together these pieces keep every update on the three stored blocks, so the full tensor is never assembled and the exact t-CUR identity $X = C \ast U^\dagger \ast R$ provides the final reconstruction.

What would settle it

Take a synthetic low-tubal-rank tensor of size roughly $120 \times 120 \times 8$, fix the t-CCS cross fraction small enough that the intersection block holds only a few slices, and place all gross outliers inside that intersection rather than spreading them across the cross. If R-ItCUR's relative error then rises well above the clean-case level while a full-tensor robust method on the same observations stays accurate, the blockwise subspace-projection heuristic is the failing link: the corrupted intersection's estimated subspaces would no longer support the exterior blocks.

Watch

Extended reading notes

Core claim

The central claim is that robust low-tubal-rank tensor completion is achievable under t-CCS sampling provided the outliers are tube-wise sparse: each corrupted tube is entirely corrupted, and at most an $\alpha$ fraction of tubes in every row and column is affected. The paper argues that this model is the right match for the t-SVD framework because tube-wise sparsity is preserved by the Fourier transform along the third mode, so every frontal slice of the outlier tensor shares one common support. On this basis, R-ItCUR alternates a blockwise Welsch correction, whose scale is set adaptively by an empirical quantile rule that needs only the contamination fraction $\alpha$, with projected blockwise gradient descent on the three cross blocks. The projection is the load-bearing step: a rank-$r$ truncated t-SVD of the intersection block, $X_U^\ell = W^\ell \ast \Theta^\ell \ast (V^\ell)^\top$, yields tubal column and row subspaces, and the exterior blocks are projected onto these subspaces, producing the next t-CUR reconstruction $X^\ell = X_C^\ell \ast (X_U^\ell)^\dagger \ast X_R^\ell$. The experiments report that this cross-only procedure recovers tensors as accurately as the nonrobust solver on clean data, that accuracy improves as outlier magnitude grows, and that a generic robust full-tensor method degrades under t-CCS, indicating that the cross structure itself must be exploited.

Load-bearing premise

The method assumes that the rank-$r$ subspaces estimated from the partially observed, possibly corrupted intersection block are accurate enough to serve as projection bases for the two exterior blocks; if the intersection is too small, too sparsely observed, or too heavily corrupted, errors made there propagate through the subspace projection to the whole reconstruction, and this step is a heuristic without an accompanying guarantee.

Editorial extensions

If this is right

  • Robust t-CCS completion is possible without ever forming the full tensor, so memory and per-iteration cost scale with the sampled cross rather than with the ambient size $n_1 n_2 n_3$.
  • Setting the contamination fraction $\alpha = 0$ reduces R-ItCUR to the nonrobust t-CUR solver, and the reported PSNR values coincide in the clean case on both MRI and seismic data, so robustness is added without sacrificing clean-case accuracy.
  • Under identical t-CCS observations R-ItCUR consistently outperforms a robust full-tensor method, while that same full-tensor method scores higher under uniform sampling, indicating that exploiting the cross-concentrated geometry is itself a source of robustness.
  • Recovery accuracy improves as outlier magnitude grows — median relative error on synthetic tensors falls from $3.44 \times 10^{-2}$ at magnitude factor $c=10$ to $2.20 \times 10^{-2}$ at $c=200$ — because larger outliers separate more cleanly from the low-rank signal under the Welsch correction.
  • The adaptive quantile rule sets the Welsch scale from the contamination fraction alone, so the user does not need to know the outlier magnitudes in advance.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial note on the paper's own caveat: in Section 5.1 the authors state that most synthetic trials reach the 100-iteration cap, so the reported curves establish stable residual reduction rather than strict convergence under the stopping tolerance; steady-state behavior, not certified convergence, is what the numerics support.
  • The subspace-projection step is the natural target for a follow-up theory: if the intersection block satisfied an incoherence or restricted-isometry condition for the t-SVD, the exterior projections might admit a linear-convergence guarantee, an argument this paper does not attempt.
  • The tube-wise sparsity model sets a real boundary: corruptions scattered as individual entries rather than whole tubes would lose the common-support property across Fourier slices that the analysis relies on, so an entrywise outlier model would likely need a different correction.
  • Because every update touches only the three stored blocks, the same skeleton — Welsch correction plus subspace projection — could transfer to other sampling designs with an overlap block, such as multiple crosses or fiber-concentrated patterns; the paper does not explore this.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. This paper studies robust completion of third-order low-tubal-rank tensors from tensor cross-concentrated sampling (t-CCS) when the observations are contaminated by sparse, arbitrarily large outliers. The proposed algorithm, R-ItCUR, stores only the three sampled cross blocks, applies an adaptive blockwise Welsch correction to suppress outliers, updates the intersection block by a truncated t-SVD, and projects the exterior blocks onto the resulting tubal column and row subspaces. The output is an implicit t-CUR representation, so the full tensor is never formed during the iterations. The paper reports synthetic experiments and real-data experiments on a cardiac MRI volume and a 3D seismic data set, comparing R-ItCUR with the nonrobust t-CCS method ITCURTC and with a robust full-tensor iterative hard-thresholding method under both t-CCS and matched uniform sampling.

Significance. If the reported empirical behavior is representative, R-ItCUR is a practically useful and computationally efficient algorithm for robust tensor completion under structured sampling: it extends the t-CUR framework to corrupted observations while preserving the memory savings of working only on the sampled cross. The experimental design is carefully matched across methods, using the same masks, corruption supports, and corruption amplitudes in paired comparisons, and the authors are transparent about the fact that synthetic relative errors do not vanish. The main value of the paper is algorithmic and empirical rather than theoretical, since no convergence or recovery guarantees are provided. The significance is tempered by a mismatch between the formal tube-wise outlier model and the entrywise corruptions used in all experiments, and by the heuristic subspace-propagation step that is not stress-tested. These issues are fixable, but they affect how strongly the central claim can be stated.

major comments (3)
  1. [Section 3.2 and Sections 5.1-5.3] Assumption 3.1 defines tube-wise alpha-sparsity: at most alpha n2 full tubes per horizontal direction and alpha n1 per lateral direction may be corrupted. Lemma 3.2 then argues that each Fourier slice has the same sparse support, which is the stated justification for the robust strategy. However, all numerical experiments corrupt individual entries rather than full tubes: Eq. (19) selects ceil(alpha |Omega|) observed entries uniformly at random, Eq. (21) corrupts round(alpha |Omega|) entries, and the seismic experiments corrupt ceil(alpha |Omega|) entries. A randomly chosen corrupted entry is a tube with only one nonzero entry, so the experiments are not instances of Assumption 3.1 and Lemma 3.2 does not apply to them. Because the paper provides no recovery guarantee, the central claim that R-ItCUR is robust under the formal t-CCS sparse-corruption model is supported only for a different, entrywise outlier model. Please add tube-wise corruption experiments that satisfy Assumption 3.1 or reformulate the problem in terms of entrywise sparsity and remove the Fourier-support argument.
  2. [Section 4.2, Eqs. (11)-(12)] The recovery of the exterior blocks depends entirely on the tubal column and row subspaces W^l and V^l estimated from the truncated t-SVD of the intersection block X_U. If the intersection is small, its sampling within the cross is sparse, or its observed entries are heavily corrupted, W^l and V^l can be poor approximations of the true subspaces, and the projection step in (12) propagates this error to X_R' and X_C' with no mechanism for the exterior blocks to correct the subspace estimate. This is a heuristic step, and no perturbation analysis or numerical ablation is provided that varies |I|, |J|, the within-intersection sampling rate, or the concentration of corruptions inside U. Since the paper makes no convergence guarantee, this assumption is load-bearing for the claim that the implicit t-CUR update recovers the tensor.
  3. [Section 4.1, Eq. (8)] The function W_sigma(E) = (1 - exp(-E odot E / (2 sigma^2))) odot E is not the standard Welsch influence function. For the Welsch loss rho(x) = 1 - exp(-x^2 / (2 sigma^2)), the influence function is x exp(-x^2 / (2 sigma^2)), which tends to zero for large |x|, whereas the displayed formula tends to E for large |E|. The text states that this correction is 'smooth, bounded, and nonconvex' and that it suppresses the influence of large residuals, which is inaccurate for the displayed function. The algorithm may still be sensible as a smooth surrogate for hard thresholding of residuals, but the naming, the description, and the connection to references [48,49] should be corrected.
minor comments (5)
  1. [Section 4] The definition of Omega_U contains a typo: 'Omega_U = (Omega_R cup Omega_U) cap (I times J times [n3])' should presumably read '(Omega_R cup Omega_C) cap (I times J times [n3])'.
  2. [Table 5] Several rows in Table 5 have missing separators between the R-ItCUR and ITCURTC columns, e.g., '27.388.69' should read '27.38 8.69'. Please fix the table formatting.
  3. [Figure 1 caption] The caption begins with '[20]', which appears to be a leftover citation reference rather than part of the caption text.
  4. [Section 5.1] The synthetic relative errors in Table 1 remain between about 2 and 5 percent, and the text itself notes that 'the reconstruction error does not vanish' and that most trials reach the iteration limit. The abstract's phrase 'accurate recovery' should be qualified in light of these values.
  5. [Section 4.1 and Algorithm 2] The contamination fraction alpha is an input to the algorithm, and all experiments use the true alpha value. No sensitivity analysis is reported for misspecified alpha, which would be relevant for practical use.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: R-ItCUR is evaluated against external ground truth and baselines; the cited t-CUR equality is an independent algebraic result.

full rationale

The paper's central claim is empirical: R-ItCUR recovers low-tubal-rank tensors under t-CCS with sparse outliers. No fitted parameter is presented as a prediction: the Welsch scale sigma is set adaptively by the quantile rule in Eq. (9) as an algorithmic heuristic, and all reported errors are measured against ground-truth tensors and compared with external baselines (ITCURTC, Robust-IHT). The block decomposition in Eq. (7) is an algebraic identity following from disjoint index sets, not a definition of the target in terms of the output. The t-CUR reconstruction in Eq. (13) invokes Theorem 2.4 (Exact t-CUR decomposition), which is a parameter-free algebraic equality from prior work [16,19]; although some authors overlap with the present paper, the theorem does not assume the recovery result and is independently checkable, so the self-citation is not load-bearing circularity. The mismatch between tube-wise Assumption 3.1 and the entrywise corruptions used in the experiments is a concern about whether the experiments test the analyzed outlier model, but it is a correctness/validation issue, not a circularity: the reported numbers do not reduce to the model assumptions by construction. No circular step meeting the quote-and-reduction standard was found.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The algorithm depends on several inputs chosen by hand or known from experiment design (alpha, eta, sigma_min, rank, and the quantile rule). The core axioms are the cited t-CUR exactness theorem, the low-tubal-rank model, the tube-wise sparsity model, and the heuristic Welsch robustness. No new physical or mathematical entities are introduced.

free parameters (4)
  • Contamination fraction alpha = 0.20 synthetic; 0 to 0.15 real
    Used in Eq. 9 to set the Welsch quantile; in all experiments alpha is the true corruption fraction. In practice it is unknown and the method gives no estimation procedure.
  • Block step sizes eta_R, eta_C, eta_U = 1 (synthetic)
    Projected gradient step sizes; set to 1 for synthetic experiments, but not reported for MRI or seismic, and no convergence analysis guides their choice.
  • sigma_min = unspecified
    Small constant in Eq. 9 to avoid division by zero; value not reported, affects Welsch correction at small residuals.
  • Target tubal rank r = 3 or 35 in experiments
    The algorithm requires the rank as input; set to 35 for MRI and 3 for seismic based on prior knowledge, not estimated.
assumptions (4)
  • standard math Theorem 2.4: exact t-CUR decomposition X = C * U† * R holds whenever rank_m(R) = rank_m(C) = r
    Cited from [19,16]; used in Eq. 13 as the conceptual reconstruction and in the output step of Algorithm 2.
  • domain assumption Ground truth tensor has tubal rank at most r
    Used throughout the problem formulation Eq. 6 and in the rank-r t-SVD truncation step Eq. 11; no validation of this assumption on real data.
  • domain assumption Tube-wise alpha-sparsity of outlier tensor S (Assumption 3.1)
    Motivates Fourier support preservation (Lemma 3.2), though the experiments corrupt entries, not whole tubes.
  • ad hoc to paper Welsch correction with adaptive sigma separates outliers from low-rank component
    No proof; the paper argues smoothness reduces support switching. Relies on residual magnitudes being separable, without formal conditions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling." pith.science (2026). https://pith.science/paper/PKVCVISD

@misc{pith2026260803928,
  author       = {Pith},
  title        = {Pith review of: Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PKVCVISD}},
  note         = {Machine review of arXiv:2608.03928}
}
read the original abstract

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.

Figures

Figures reproduced from arXiv: 2608.03928 by the authors.

Figure 1
Figure 1. [20]. Illustration of four sampling strategies at the same total observation rate: Bernoulli, less concentrated t-CCS, more concentrated t-CCS, and tensor CUR. Blue, yellow and green grids mark the observed entries in the lateral, horizontal and intersected subtensors, respectively. Sparse corruption. A second gap between existing theory and practice arises from data corruption. Real-world measurements are often cor… view at source ↗
Figure 2
Figure 2. Observed-residual decay of the Welsch-based R-ItCUR method on synthetic low-tubal-rank [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. Representative MRI reconstructions under value-independent sampling with [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Representative seismic reconstructions with [PITH_FULL_IMAGE:figures/full_fig_p018_4.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references · 4 linked inside Pith

  1. [1]

    Tensor completion for estimating missing values in visual data.IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(1):208–220, 2013

    Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. Tensor completion for estimating missing values in visual data.IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(1):208–220, 2013

    2013

  2. [2]

    Factorization strategies for third-order tensors.Linear Algebra and its Applications, 435(3):641–658, 2011

    Misha E Kilmer and Carla D Martin. Factorization strategies for third-order tensors.Linear Algebra and its Applications, 435(3):641–658, 2011

    2011

  3. [3]

    Weighted low-rank tensor recovery for hyperspectral image restoration.arXiv preprint arXiv:1709.00192, 2017

    Yi Chang, Luxin Yan, Houzhang Fang, Sheng Zhong, and Zhijun Zhang. Weighted low-rank tensor recovery for hyperspectral image restoration.arXiv preprint arXiv:1709.00192, 2017. 19

    arXiv 2017

  4. [4]

    Mode-wise tensor decom- positions: Multi-dimensional generalizations of CUR decompositions.Journal of Machine Learning Research, 22(185):1–36, 2021

    HanQin Cai, Keaton Hamm, Longxiu Huang, and Deanna Needell. Mode-wise tensor decom- positions: Multi-dimensional generalizations of CUR decompositions.Journal of Machine Learning Research, 22(185):1–36, 2021

    2021

  5. [5]

    A tensor higher-order singular value decomposition for prestack seismic data noise reduction and interpolation.Geophysics, 77(3):V113–V122, 2012

    Nadia Kreimer and Mauricio D Sacchi. A tensor higher-order singular value decomposition for prestack seismic data noise reduction and interpolation.Geophysics, 77(3):V113–V122, 2012

    2012

  6. [6]

    Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering

    Alexandros Karatzoglou, Xavier Amatriain, Linas Baltrunas, and Nuria Oliver. Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. InProceedings of the fourth ACM conference on Recommender systems, pages 79–86, 2010

    2010

  7. [7]

    Novel methods for multilinear data completion and de-noising based on tensor-SVD

    Zemin Zhang, Gregory Ely, Shuchin Aeron, Ning Hao, and Misha Kilmer. Novel methods for multilinear data completion and de-noising based on tensor-SVD. InProceedings of the IEEE conference on computer vision and pattern recognition, pages 3842–3849, 2014

    2014

  8. [8]

    Exact tensor completion using t-SVD.IEEE Transactions on Signal Processing, 65(6):1511–1526, 2016

    Zemin Zhang and Shuchin Aeron. Exact tensor completion using t-SVD.IEEE Transactions on Signal Processing, 65(6):1511–1526, 2016

    2016

Show all 51 references
  1. [9]

    Optimal matrix-mimetic tensor algebras via variable projection.SIAM Journal on Matrix Analysis and Applications, 46(3):1764–1790, 2025

    Elizabeth Newman and Katherine Keegan. Optimal matrix-mimetic tensor algebras via variable projection.SIAM Journal on Matrix Analysis and Applications, 46(3):1764–1790, 2025

    2025

  2. [10]

    Collaborative filtering and the missing at random assumption.arXiv preprint arXiv:1206.5267, 2012

    Benjamin Marlin, Richard S Zemel, Sam Roweis, and Malcolm Slaney. Collaborative filtering and the missing at random assumption.arXiv preprint arXiv:1206.5267, 2012

    2012 arXiv

  3. [11]

    Variable density sampling with continuous trajectories.SIAM Journal on Imaging Sciences, 7(4):1962–1992, 2014

    Nicolas Chauffert, Philippe Ciuciu, Jonas Kahn, and Pierre Weiss. Variable density sampling with continuous trajectories.SIAM Journal on Imaging Sciences, 7(4):1962–1992, 2014

    1962

  4. [12]

    Tensor CUR decomposition under t-product and its perturbation.Numerical Functional Analysis and Optimization, 43(6):698–722, 2022

    Juefei Chen, Yimin Wei, and Yanwei Xu. Tensor CUR decomposition under t-product and its perturbation.Numerical Functional Analysis and Optimization, 43(6):698–722, 2022

    2022

  5. [13]

    Adaptive cross tubal tensor approximation.Linear Algebra and its Applications, 695:168–190, 2024

    Salman Ahmadi-Asl, Anh Huy Phan, Andrzej Cichocki, Anastasia Sozykina, Zaher Al Aghbari, Jun Wang, and Ivan Oseledets. Adaptive cross tubal tensor approximation.Linear Algebra and its Applications, 695:168–190, 2024

    2024

  6. [14]

    CUR matrix decompositions for improved data analysis.Proceedings of the National Academy of Sciences, 106(3):697–702, 2009

    Michael W Mahoney and Petros Drineas. CUR matrix decompositions for improved data analysis.Proceedings of the National Academy of Sciences, 106(3):697–702, 2009

    2009

  7. [15]

    Relative-error CUR matrix decompositions.SIAM Journal on Matrix Analysis and Applications, 30(2):844–881, 2008

    Petros Drineas, Michael W Mahoney, and Shan Muthukrishnan. Relative-error CUR matrix decompositions.SIAM Journal on Matrix Analysis and Applications, 30(2):844–881, 2008

    2008

  8. [16]

    Perspectives on CUR decompositions.Applied and Computational Harmonic Analysis, 48(3):1088–1099, 2020

    Keaton Hamm and Longxiu Huang. Perspectives on CUR decompositions.Applied and Computational Harmonic Analysis, 48(3):1088–1099, 2020

    2020

  9. [17]

    Stability of sampling for CUR decompositions.Foundations of Data Science, 2(2):83–99, 2020

    Keaton Hamm and Longxiu Huang. Stability of sampling for CUR decompositions.Foundations of Data Science, 2(2):83–99, 2020

    2020

  10. [18]

    HanQin Cai, Longxiu Huang, Pengyu Li, and Deanna Needell. Matrix completion with cross- concentrated sampling: Bridging uniform sampling and CUR sampling.IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(8):10100–10113, 2023

    2023

  11. [19]

    Guaranteed sampling flexibility for low-tubal-rank tensor completion.arXiv preprint arXiv:2406.11092, 2024

    Bowen Su, Juntao You, HanQin Cai, and Longxiu Huang. Guaranteed sampling flexibility for low-tubal-rank tensor completion.arXiv preprint arXiv:2406.11092, 2024. 20

    2024 arXiv

  12. [20]

    On the robustness of cross- concentrated sampling for matrix completion

    HanQin Cai, Longxiu Huang, Chandra Kundu, and Bowen Su. On the robustness of cross- concentrated sampling for matrix completion. In58th Annual Conference on Information Sciences and Systems, pages 1–5, 2024

    2024

  13. [21]

    Cand` es, Xiaodong Li, Yi Ma, and John Wright

    Emmanuel J. Cand` es, Xiaodong Li, Yi Ma, and John Wright. Robust principal component analysis?Journal of the ACM, 58(3):1–37, 2011

    2011

  14. [22]

    Non- convex robust PCA

    Praneeth Netrapalli, UN Niranjan, Sujay Sanghavi, Anima Anandkumar, and Prateek Jain. Non- convex robust PCA. InAdvances in neural information processing systems, pages 1107–1115, 2014

    2014

  15. [23]

    Fast algorithms for robust PCA via gradient descent.Advances in neural information processing systems, 29, 2016

    Xinyang Yi, Dohyung Park, Yudong Chen, and Constantine Caramanis. Fast algorithms for robust PCA via gradient descent.Advances in neural information processing systems, 29, 2016

    2016

  16. [24]

    Accelerated alternating projections for robust principal component analysis.Journal of Machine Learning Research, 20(1):685–717, 2019

    HanQin Cai, Jian-Feng Cai, and Ke Wei. Accelerated alternating projections for robust principal component analysis.Journal of Machine Learning Research, 20(1):685–717, 2019

    2019

  17. [25]

    Learned robust PCA: A scalable deep unfolding approach for high-dimensional outlier detection

    HanQin Cai, Jialin Liu, and Wotao Yin. Learned robust PCA: A scalable deep unfolding approach for high-dimensional outlier detection. InAdvances in Neural Information Processing Systems, volume 34, pages 16977–16989, 2021

    2021

  18. [26]

    Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent.Journal of Machine Learning Research, 22(150):1–63, 2021

    Tian Tong, Cong Ma, and Yuejie Chi. Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent.Journal of Machine Learning Research, 22(150):1–63, 2021

    2021

  19. [27]

    Tensor robust principal component analysis with a new tensor nuclear norm.IEEE transactions on pattern analysis and machine intelligence, 42(4):925–938, 2019

    Canyi Lu, Jiashi Feng, Yudong Chen, Wei Liu, Zhouchen Lin, and Shuicheng Yan. Tensor robust principal component analysis with a new tensor nuclear norm.IEEE transactions on pattern analysis and machine intelligence, 42(4):925–938, 2019

    2019

  20. [28]

    Low-rank matrix recovery from errors and erasures.IEEE Transactions on Information Theory, 59(7):4324–4337, 2013

    Yudong Chen, Ali Jalali, Sujay Sanghavi, and Constantine Caramanis. Low-rank matrix recovery from errors and erasures.IEEE Transactions on Information Theory, 59(7):4324–4337, 2013

    2013

  21. [29]

    Robust matrix completion.Probability Theory and Related Fields, 169(1):523–564, 2017

    Olga Klopp, Karim Lounici, and Alexandre B Tsybakov. Robust matrix completion.Probability Theory and Related Fields, 169(1):523–564, 2017

    2017

  22. [30]

    Nearly optimal robust matrix completion

    Yeshwanth Cherapanamjeri, Kartik Gupta, and Prateek Jain. Nearly optimal robust matrix completion. InInternational conference on machine learning, pages 797–805. PMLR, 2017

    2017

  23. [31]

    Deeply learned robust matrix completion for large-scale low-rank data recovery.IEEE Transactions on Pattern Analysis and Machine Intelligence, 48(6):6541–6556, 2026

    HanQin Cai, Chandra Kundu, Jialin Liu, and Wotao Yin. Deeply learned robust matrix completion for large-scale low-rank data recovery.IEEE Transactions on Pattern Analysis and Machine Intelligence, 48(6):6541–6556, 2026

    2026

  24. [32]

    Nonconvex robust low-rank matrix recovery.SIAM Journal on Optimization, 30(1):660–686, 2020

    Xiao Li, Zhihui Zhu, Anthony Man-Cho So, and Rene Vidal. Nonconvex robust low-rank matrix recovery.SIAM Journal on Optimization, 30(1):660–686, 2020

    2020

  25. [33]

    Guarantees of a preconditioned subgradi- ent algorithm for overparameterized asymmetric low-rank matrix recovery

    Paris Giampouras, HanQin Cai, and Ren´ e Vidal. Guarantees of a preconditioned subgradi- ent algorithm for overparameterized asymmetric low-rank matrix recovery. InInternational Conference on Machine Learning, 2025

    2025

  26. [34]

    Robust matrix completion via maximum correntropy criterion and half-quadratic optimization.IEEE Transactions on Signal Processing, 68:181–195, 2019

    Yicong He, Fei Wang, Yingsong Li, Jing Qin, and Badong Chen. Robust matrix completion via maximum correntropy criterion and half-quadratic optimization.IEEE Transactions on Signal Processing, 68:181–195, 2019. 21

    2019

  27. [35]

    Robust spectral compressed sensing via structured matrix completion.IEEE Transactions on Information Theory, 60(10):6576–6601, 2014

    Yuxin Chen and Yuejie Chi. Robust spectral compressed sensing via structured matrix completion.IEEE Transactions on Information Theory, 60(10):6576–6601, 2014

    2014

  28. [36]

    Correction of corrupted columns through fast robust hankel matrix completion.IEEE Transactions on Signal Processing, 67(10):2580–2594, 2019

    Shuai Zhang and Meng Wang. Correction of corrupted columns through fast robust hankel matrix completion.IEEE Transactions on Signal Processing, 67(10):2580–2594, 2019

    2019

  29. [37]

    Structured gradient descent for fast robust low- rank hankel matrix completion.SIAM Journal on Scientific Computing, 45(3):A1172–A1198, 2023

    HanQin Cai, Jian-Feng Cai, and Juntao You. Structured gradient descent for fast robust low- rank hankel matrix completion.SIAM Journal on Scientific Computing, 45(3):A1172–A1198, 2023

    2023

  30. [38]

    Accelerating ill-conditioned hankel matrix recovery via structured newton-like descent.Inverse Problems, 41(7):075015, 2025

    HanQin Cai, Longxiu Huang, Xiliang Lu, and Juntao You. Accelerating ill-conditioned hankel matrix recovery via structured newton-like descent.Inverse Problems, 41(7):075015, 2025

    2025

  31. [39]

    Robust low-rank tensor recovery: Models and algorithms

    Donald Goldfarb and Zhiwei Qin. Robust low-rank tensor recovery: Models and algorithms. SIAM Journal on Matrix Analysis and Applications, 35(1):225–253, 2014

    2014

  32. [40]

    Bayesian robust tensor factorization for incomplete multiway data.IEEE transactions on neural networks and learning systems, 27(4):736–748, 2015

    Qibin Zhao, Guoxu Zhou, Liqing Zhang, Andrzej Cichocki, and Shun-Ichi Amari. Bayesian robust tensor factorization for incomplete multiway data.IEEE transactions on neural networks and learning systems, 27(4):736–748, 2015

    2015

  33. [41]

    Robust low-rank tensor ring completion

    Huyan Huang, Yipeng Liu, Zhen Long, and Ce Zhu. Robust low-rank tensor ring completion. IEEE Transactions on Computational Imaging, 6:1117–1126, 2020

    2020

  34. [42]

    Robust tensor completion: Equivalent surrogates, error bounds, and algorithms.SIAM Journal on Imaging Sciences, 15(2):625–669, 2022

    Xueying Zhao, Minru Bai, Defeng Sun, and Libin Zheng. Robust tensor completion: Equivalent surrogates, error bounds, and algorithms.SIAM Journal on Imaging Sciences, 15(2):625–669, 2022

    2022

  35. [43]

    Qiang Jiang and Michael K. Ng. Robust low-tubal-rank tensor completion via convex opti- mization. InProceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI), pages 2649–2655, 2019

    2019

  36. [44]

    Robust low-tubal-rank tensor completion

    Andong Wang, Xulin Song, Xiyin Wu, Zhihui Lai, and Zhong Jin. Robust low-tubal-rank tensor completion. InICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 3432–3436. IEEE, 2019

    2019

  37. [45]

    Yicong He and George K. Atia. Robust low-tubal-rank tensor completion based on tensor factorization and maximum correntropy criterion.IEEE Transactions on Neural Networks and Learning Systems, 35(10):14603–14617, 2024

    2024

  38. [46]

    Guaranteed nonconvex low-rank tensor estimation via scaled gradient descent

    Tong Wu. Guaranteed nonconvex low-rank tensor estimation via scaled gradient descent. Journal of Machine Learning Research, 27(9):1–90, 2026

    2026

  39. [47]

    Robust tensor CUR decom- positions: Rapid low-tucker-rank tensor recovery with sparse corruptions.SIAM Journal on Imaging Sciences, 17(1):225–247, 2024

    HanQin Cai, Zehan Chao, Longxiu Huang, and Deanna Needell. Robust tensor CUR decom- positions: Rapid low-tucker-rank tensor recovery with sparse corruptions.SIAM Journal on Imaging Sciences, 17(1):225–247, 2024

    2024

  40. [48]

    Robust regression using iteratively reweighted least-squares

    Paul W Holland and Roy E Welsch. Robust regression using iteratively reweighted least-squares. Communications in Statistics-theory and Methods, 6(9):813–827, 1977

    1977

  41. [49]

    Black and Anand Rangarajan

    Michael J. Black and Anand Rangarajan. On the unification of line processes, outlier rejection, and robust statistics with applications in early vision.International Journal of Computer Vision, 19(1):57–91, 1996. 22

    1996

  42. [50]

    A large annotated medical image dataset for the development and evaluation of segmentation algorithms.arXiv preprint arXiv:1902.09063, 2019

    Amber L Simpson, Michela Antonelli, Spyridon Bakas, Michel Bilello, Keyvan Farahani, Bram Van Ginneken, Annette Kopp-Schneider, Bennett A Landman, Geert Litjens, Bjoern Menze, et al. A large annotated medical image dataset for the development and evaluation of segmentation alg...

    1902 arXiv

  43. [51]

    The medical segmentation decathlon.Nature communications, 13(1), 2022

    Michela Antonelli, Annika Reinke, Spyridon Bakas, Keyvan Farahani, Annette Kopp-Schneider, Bennett A Landman, Geert Litjens, Bjoern Menze, Olaf Ronneberger, Ronald M Summers, et al. The medical segmentation decathlon.Nature communications, 13(1), 2022. 23

    2022

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.