Almost-lossless compression of a low-rank random tensor
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Oct-23-2022
- Genre:
- Research Report (0.83)
- Technology:
- Information Technology
- Artificial Intelligence (0.94)
- Data Science > Data Mining (0.46)
- Information Technology