Matrix Factor Analysis: From Least Squares to Iterative Projection*

Yong He, Xin-Bing Kong, Long Yu, Xinsheng Zhang, Changwei Zhao
{"title":"Matrix Factor Analysis: From Least Squares to Iterative Projection*","authors":"Yong He, Xin-Bing Kong, Long Yu, Xinsheng Zhang, Changwei Zhao","doi":"10.1080/07350015.2023.2191676","DOIUrl":null,"url":null,"abstract":"In this article, we study large-dimensional matrix factor models and estimate the factor loading matrices and factor score matrix by minimizing square loss function. Interestingly, the resultant estimators coincide with the Projected Estimators (PE) in Yu et al.(2022), which was proposed from the perspective of simultaneous reduction of the dimensionality and the magnitudes of the idiosyncratic error matrix. In other word, we provide a least-square interpretation of the PE for matrix factor model, which parallels to the least-square interpretation of the PCA for the vector factor model. We derive the convergence rates of the theoretical minimizers under sub-Gaussian tails. Considering the robustness to the heavy tails of the idiosyncratic errors, we extend the least squares to minimizing the Huber loss function, which leads to a weighted iterative projection approach to compute and learn the parameters. We also derive the convergence rates of the theoretical minimizers of the Huber loss function under bounded $(2+\\epsilon)$th moment of the idiosyncratic errors. We conduct extensive numerical studies to investigate the empirical performance of the proposed Huber estimators relative to the state-of-the-art ones. The Huber estimators perform robustly and much better than existing ones when the data are heavy-tailed, and as a result can be used as a safe replacement in practice. An application to a Fama-French financial portfolio dataset demonstrates the empirical advantage of the Huber estimator.","PeriodicalId":118766,"journal":{"name":"Journal of Business & Economic Statistics","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Business & Economic Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/07350015.2023.2191676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

In this article, we study large-dimensional matrix factor models and estimate the factor loading matrices and factor score matrix by minimizing square loss function. Interestingly, the resultant estimators coincide with the Projected Estimators (PE) in Yu et al.(2022), which was proposed from the perspective of simultaneous reduction of the dimensionality and the magnitudes of the idiosyncratic error matrix. In other word, we provide a least-square interpretation of the PE for matrix factor model, which parallels to the least-square interpretation of the PCA for the vector factor model. We derive the convergence rates of the theoretical minimizers under sub-Gaussian tails. Considering the robustness to the heavy tails of the idiosyncratic errors, we extend the least squares to minimizing the Huber loss function, which leads to a weighted iterative projection approach to compute and learn the parameters. We also derive the convergence rates of the theoretical minimizers of the Huber loss function under bounded $(2+\epsilon)$th moment of the idiosyncratic errors. We conduct extensive numerical studies to investigate the empirical performance of the proposed Huber estimators relative to the state-of-the-art ones. The Huber estimators perform robustly and much better than existing ones when the data are heavy-tailed, and as a result can be used as a safe replacement in practice. An application to a Fama-French financial portfolio dataset demonstrates the empirical advantage of the Huber estimator.
矩阵因子分析:从最小二乘到迭代投影*
本文研究了大维矩阵因子模型,通过最小化平方损失函数来估计因子加载矩阵和因子得分矩阵。有趣的是,所得估计量与Yu等人(2022)的投影估计量(PE)相吻合,该估计量是从同时降低特异性误差矩阵的维数和幅度的角度提出的。换句话说,我们为矩阵因子模型提供了PE的最小二乘解释,这与向量因子模型的PCA的最小二乘解释相似。我们导出了在亚高斯尾下理论极小值的收敛速率。考虑到对特殊误差重尾的鲁棒性,我们将最小二乘扩展到最小化Huber损失函数,从而导致加权迭代投影方法来计算和学习参数。我们还推导了Huber损失函数在有界$(2+\epsilon)$th阶矩下的理论极小值的收敛速率。我们进行了广泛的数值研究,以调查所提出的Huber估计器相对于最先进的经验性能。当数据是重尾时,Huber估计器的鲁棒性比现有的估计器好得多,因此在实践中可以作为安全的替代。对Fama-French金融组合数据集的应用证明了Huber估计量的经验优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信