Almost-lossless compression of a low-rank random tensor

Minh Thanh Vu

REVIEW

Almost-lossless compression of a low-rank random tensor

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 2210.04041 v2 pith:IXLVVCJ4 submitted 2022-10-08 cs.IT cs.LGeess.SPmath.IT

Almost-lossless compression of a low-rank random tensor

Minh Thanh Vu This is my paper

classification cs.IT cs.LGeess.SPmath.IT

keywords almost-losslesscompressionlow-rankrandomtensoradmitsalphabetasymptotic

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

0 comments

read the original abstract

In this work, we establish an asymptotic limit of almost-lossless compression of a random, finite alphabet tensor which admits a low-rank canonical polyadic decomposition.

Almost-lossless compression of a low-rank random tensor

discussion (0)