Pith. sign in

REVIEW 1 cited by

Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions

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 2103.11037 v2 pith:L4ORAHFD submitted 2021-03-19 math.NA cs.ITcs.LGcs.NAeess.IVmath.IT

classification math.NAcs.ITcs.LGcs.NAeess.IVmath.IT
keywords tensorapproximationsdecompositionsrankmultilinearsamplingadvantageadversarial
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Low rank tensor approximation is a fundamental tool in modern machine learning and data science. In this paper, we study the characterization, perturbation analysis, and an efficient sampling strategy for two primary tensor CUR approximations, namely Chidori and Fiber CUR. We characterize exact tensor CUR decompositions for low multilinear rank tensors. We also present theoretical error bounds of the tensor CUR approximations when (adversarial or Gaussian) noise appears. Moreover, we show that low cost uniform sampling is sufficient for tensor CUR approximations if the tensor has an incoherent structure. Empirical performance evaluations, with both synthetic and real-world datasets, establish the speed advantage of the tensor CUR approximations over other state-of-the-art low multilinear rank tensor approximations.

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. Matrices over a Hilbert space and their low-rank cross approximation

    math.NA 2025-05 conditional novelty 5.0 of 10

    Bochner matrices (matrices with Hilbert-space entries) admit cross decompositions and a new adaptive cross-dyadic approximation algorithm that numerically approximates parametric PDE solution maps.

Pith tools