Hadamard–Hitchcock decompositions: Identifiability and computation

A Hadamard–Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise from statistical graphical models associated to complete bipartite graphs with one layer of observed random variables and one layer of hidden ones, usually called restricted Boltzmann machines. We establish generic identifiability of Hadamard–Hitchcock decompositions by exploiting the reshaped Kruskal criterion for tensor rank decompositions. An algorithm leveraging existing decomposition algorithms for tensor rank decomposition is introduced for computing a Hadamard–Hitchcock decomposition. Numerical experiments illustrate its computational performance and numerical accuracy in a noiseless setting.