Randomized algorithms for the low multilinear rank approximations of tensors

Hong Yan; Maolin Che; Yimin Wei

REVIEW

Randomized algorithms for the low multilinear rank approximations of tensors

Not yet reviewed by Pith; the record is open.

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

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 1908.11031 v2 pith:FYMTBYRK submitted 2019-08-29 math.NA cs.NA

Randomized algorithms for the low multilinear rank approximations of tensors

Maolin Che , Yimin Wei , Hong Yan This is my paper

classification math.NA cs.NA

keywords algorithmsrandomizedapproximationsmultilinearranksingulartensorsalgorithm

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

read the original abstract

In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular values of sub-Gaussian matrices, we make a probabilistic analysis for the error bounds for the randomized algorithm. We demonstrate the effectiveness of proposed algorithms via several numerical examples.

Randomized algorithms for the low multilinear rank approximations of tensors

discussion (0)