Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/118296
DC FieldValueLanguage
dc.contributorDepartment of Data Science and Artificial Intelligence-
dc.creatorZhang, X-
dc.creatorLiu, CC-
dc.creatorGuo, J-
dc.creatorYuen, KC-
dc.creatorWelsh, AH-
dc.date.accessioned2026-03-31T03:01:35Z-
dc.date.available2026-03-31T03:01:35Z-
dc.identifier.issn0162-1459-
dc.identifier.urihttp://hdl.handle.net/10397/118296-
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.rights© 2024 American Statistical Associationen_US
dc.rightsThis is an Accepted Manuscript of an article published by Taylor & Francis in Journal of the American Statistical Association on 24 May 2024 (published online), available at: https://doi.org/10.1080/01621459.2024.2344687.en_US
dc.subjectImage reconstructionen_US
dc.subjectMatrix factor modelen_US
dc.subjectPeak signal-to-noise ratioen_US
dc.subjectRank decompositionen_US
dc.subjectSeparable covariance structureen_US
dc.subjectTensor subspaceen_US
dc.titleModeling and learning on high-dimensional matrix-variate sequencesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage419-
dc.identifier.epage434-
dc.identifier.volume120-
dc.identifier.issue549-
dc.identifier.doi10.1080/01621459.2024.2344687-
dcterms.abstractWe propose a new matrix factor model, named RaDFaM, which is strictly derived from the general rank decomposition and assumes a high-dimensional vector factor model structure for each basis vector. RaDFaM contributes a novel class of low-rank latent structures that trade off between signal intensity and dimension reduction from a tensor subspace perspective. Based on the intrinsic separable covariance structure of RaDFaM, for a collection of matrix-valued observations, we derive a new class of PCA variants for estimating loading matrices, and sequentially the latent factor matrices. The peak signal-to-noise ratio of RaDFaM is proved to be superior in the category of PCA-type estimators. We also establish an asymptotic theory including the consistency, convergence rates, and asymptotic distributions for components in the signal part. Numerically, we demonstrate the performance of RaDFaM in applications such as matrix reconstruction, supervised learning, and clustering, on uncorrelated and correlated data, respectively. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of the American Statistical Association, 2025, v. 120, no. 549, p. 419-434-
dcterms.isPartOfJournal of the American Statistical Association-
dcterms.issued2025-
dc.identifier.scopus2-s2.0-105002648592-
dc.identifier.eissn1537-274X-
dc.description.validate202603 bcjz-
dc.description.oaAccepted Manuscripten_US
dc.identifier.SubFormIDG001392/2025-12en_US
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextXu Zhang’s research was partially supported by the National Natural Science Foundation of China (grant no.12301338) and the Postdoc Fellowship of CAS AMSS-PolyU Joint Laboratory of Applied Mathematics. Catherine C. Liu’s research was partially supported by General Research Fund 15301123, RGC, HKSAR, and PolyU Research Grant P0045497. Jianhua Guo’s research was partially supported by the National Key Research and Development Program of China (grant no.2020YFA0714100). K. C. Yuen’s research was partially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. HKU17306220). A. H. Welsh’s research was partially supported by the Australian Research Council Discovery Project DP230101908.en_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.