REVIEW
Almost-lossless compression of a low-rank random tensor
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
classification
cs.ITcs.LGeess.SPmath.IT
keywords
almost-losslesscompressionlow-rankrandomtensoradmitsalphabetasymptotic
Signed reviews
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.
Discussion (0). Continue with ORCID to comment.