19 citations · 22 across the 6 of their papers we have counts for
1 paper · 1 filter
Minh Thanh Vu
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.