Almost-lossless compression of a low-rank random tensor
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IXLVVCJ4record.jsonopen to challenge →
classification
cs.IT
cs.LGeess.SPmath.IT
keywords
almost-losslesscompressionlow-rankrandomtensoradmitsalphabetasymptotic
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.