paper-with-me

Papers

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

2025-11-07 · Carlos Llosa-Vite, Daniel M. Dunlavy, Richard B. Lehoucq, Oscar López, Arvind Prasadan 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.

📄 PDF Abstract BibTeX arXiv:2511.05352

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Dictionary-based Tensor Canonical Polyadic Decomposition

2017-04-03 · Jérémy E. Cohen, Nicolas Gillis

To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictio…

Tensor Decomposition

Learning Fair Canonical Polyadical Decompositions using a Kernel Independence Criterion

2021-04-27 · Kevin Kim, Alex Gittens

This work proposes to learn fair low-rank tensor decompositions by regularizing the Canonical Polyadic Decomposition factorization with the kernel Hilbert-Schmidt independence criterion (KHSIC). It is shown, theoreticall…

Fairness

Web Service QoS Prediction via Extended Canonical Polyadic-based Tensor Network

2024-08-29 · Qu Wang, Hao Wu

Today, numerous web services with similar functionalities are available on the Internet. Users often evaluate the Quality of Service (QoS) to choose the best option among them. Predicting the QoS values of these web serv…

Prediction

Zero-Truncated Poisson Regression for Sparse Multiway Count Data Corrupted by False Zeros

2022-01-25 · Oscar López, Daniel M. Dunlavy, Richard B. Lehoucq

We propose a novel statistical inference methodology for multiway count data that is corrupted by false zeros that are indistinguishable from true zero counts. Our approach consists of zero-truncating the Poisson distrib…

regression

A parametric non-negative coupled canonical polyadic decomposition algorithm for hyperspectral super-resolution

2025-01-25 · Xi-Yuan Liu, Xiao-Feng Gong, Lei Wang, Wei Feng 외

Recently, coupled tensor decomposition has been widely used in data fusion of a hyperspectral image (HSI) and a multispectral image (MSI) for hyperspectral super-resolution (HSR). However, exsiting works often ignore the…

Super-ResolutionTensor Decomposition