Metraipolis › archive › dc_387fd892fe78
Identification problem and quasi-maximum likelihood estimation for matrix-variate CP-factor models — arXiv:2609.20910
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20910
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:04:23.196Z
- SHA-256 of the archived text
dc2479886b4c954bf91dbbf56304b6f8aa3fb83dba04c0de1d33adc442ba3583- Stable URL of this page
https://metraipolis.com/documento/dc_387fd892fe78
How to cite
Identification problem and quasi-maximum likelihood estimation for matrix-variate CP-factor models — arXiv:2609.20910 — arXiv (en), https://arxiv.org/abs/2609.20910 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_387fd892fe78 (Metraipolis archive dc_387fd892fe78, sha256 dc2479886b4c954bf91dbbf56304b6f8aa3fb83dba04c0de1d33adc442ba3583)
BibTeX
@misc{dc387fd892fe78,
title = {Identification problem and quasi-maximum likelihood estimation for matrix-variate CP-factor models — arXiv:2609.20910},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20910},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_387fd892fe78; sha256 dc2479886b4c954bf91dbbf56304b6f8aa3fb83dba04c0de1d33adc442ba3583},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20910. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Matrix-valued time series, arising in diverse fields such as economics, neuroscience, and recommender systems, have become increasingly prominent in modern data analysis. Among various modeling frameworks, the matrix-variate CP-factor model represents an important and widely applicable class for capturing low-rank structures in matrix time series. In this paper, we provide a unified treatment for the identification problem of CP factor models using both analytic and algebraic tools. In particular, we characterize the parameter space as the union of two subspaces, one identifiable and the other non-identifiable. We show that existing estimation methods only apply to an open proper subset of the identifiable subspace. In contrast, we propose a quasi-maximum likelihood estimation (QMLE) procedure for CP factor models, which allows consistent estimation on the whole identifiable subspace. Moreover, we show that the estimated loading matrices by QMLE achieve a faster convergence rate compared to existing approaches. A simulation study and a real application are conducted to demonstrate the finite-sample performance of the proposed method. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-21 in stat.ME). Categorie arXiv: Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2609.20910 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T01:44:28.553Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).