Almost-lossless compression of a low-rank random tensor
Information Theory
2022-10-25 v2 Machine Learning
Signal Processing
math.IT
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.
Cite
@article{arxiv.2210.04041,
title = {Almost-lossless compression of a low-rank random tensor},
author = {Minh Thanh Vu},
journal= {arXiv preprint arXiv:2210.04041},
year = {2022}
}
Comments
This version fixes typos and adds some remarks