I've been working with high-dimensional binary tensors (e.g., tensors with entries that are only 0s and 1s) and I'm looking for an efficient way to decompose them into rank-1 components. The tensors I'm dealing with are also quite sparse, meaning they have a lot of zeros.
I came across traditional methods like CANDECOMP/PARAFAC (CP), Tucker, and HOSVD decompositions, but they seem to be quite computationally expensive, especially for large and sparse tensors.
Has anyone here worked on or come across an algorithm specifically designed for binary and sparse tensors? How do these methods compare in terms of computational efficiency with the traditional ones? Any insights or suggestions for efficient decomposition techniques would be greatly appreciated!
Thanks!