.png){kind=icon}
返回
Rank regularized estimation of approximate factor models
.png){kind=icon}
OA
AI
DOI：10.1016/j.jeconom.2019.04.021.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is known that the common factors in a large panel of data can be consistently estimated by the method of principal components, and principal components can be constructed by iterative least squares regressions. Replacing least squares with ridge regressions turns out to have the effect of removing the contribution of factors associated with small singular values from the common component. The method has been used in the machine learning literature to recover low-rank matrices. We study the procedure from the perspective of estimating an approximate factor model. Under the rank-constraint, the common component is estimated by the space spanned by factors whose singular values exceed a threshold. The desire for minimum rank and parsimony lead to a data-dependent penalty for selecting the number of factors. The new criterion is more conservative than the existing deterministic penalties and is appropriate when the nominal number of factors is inflated by the presence of weak factors or large measurement noise. We provide asymptotic results that can be used to test economic hypotheses. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Singular-value thresholding
Robust principal components
Minimum-rank
Low rank decomposition
Nuclear-norm minimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
5.3K
被引数:
3.0W
机构
引用论文
.png){kind=icon}
Ab Initio Study of Chemisorption Reactions for Carboxylic Acids on Hydrogenated Silicon Surfaces
PREAI
分享收藏
查看更多内容