mlsanityData to 7 Oct 2026

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

arXiv 2511.05352 ↗First posted 7 Nov 2025math.ST cs.NA math.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

We establish parameter inference for the Poisson canonical polyadic (PCP) model of tensor count data through a latent-variable formulation. Our approach exploits the property that any random tensor that follows the PCP model can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the "complete" loglikelihood, is comprised of multiple loglikelihoods corresponding to rank one PCP models. Using this methodology, we first demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model by leveraging its latent-variable formulation. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that the rank of parameter tensor plays in identifiability and indeterminacy. For the special case of PCP models with rank one parameter tensors, we demonstrate that these results are greatly simplified.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 41 references that are in the map. First posted on arXiv 7 Nov 2025.

Builds on

5 of 41 references.

References · 5

  1. 2016Tensor Decomposition for Signal Processing and Machine Learningcited by 223
  2. 2017Tensor-on-tensor regressioncited by 22
  3. 2020Reduced-Rank Tensor-on-Tensor Regression and Tensor-variate Analysis of Variancecited by 10
  4. 2017Kullback-Leibler Principal Component for Tensors is not NP-hardcited by 4
  5. 2025The Poisson tensor completion parametric estimatorcited by 1

Built on by

Not cited yet.