Rank-One Boolean Tensor Factorization and the Multilinear Polytope
Rank-One Boolean Tensor Factorization and the Multilinear Polytope
We consider the NP-hard problem of finding the closest rank-one binary tensor to a given binary tensor, which we refer to as the rank-one Boolean tensor factorization (BTF) problem. This optimization problem can be used to recover a planted rank-one tensor from noisy observations. We formulate rank-one BTF as the …