45 citations · 105 across the 23 of their papers we have counts for
3 papers · 1 filter
Tensor network complexity of multilinear maps
Per Austrin, Petteri Kaski, Kaie Kubjas
We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as $…
Maximum likelihood estimation of the Latent Class Model through model boundary decomposition
Elizabeth S. Allman, Hector Baños Cervantes, Robin Evans +5
The Expectation-Maximization (EM) algorithm is routinely used for the maximum likelihood estimation in the latent class analysis. However, the EM algorithm comes with no guarantees…
Geometry of symmetric group-based models
Dimitra Kosta, Kaie Kubjas
Phylogenetic models have polynomial parametrization maps. For symmetric group-based models, Matsen studied the polynomial inequalities that characterize the joint probabilities in…