Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.08397

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2503.08397 (math)
[Submitted on 11 Mar 2025 ]

Title: TransPCA for Large-dimensional Factor Analysis with Weak Factors: Power Enhancement via Knowledge Transfer

Title: 弱因子的大维因子分析的TransPCA:通过知识迁移增强功率

Authors:Yong He, Dong Liu, Yunjing Sun, Yalin Wang
Abstract: Early work established convergence of the principal component estimators of the factors and loadings up to a rotation for large dimensional approximate factor models with weak factors in that the factor loading $\Lambda^{(0)}$ scales sublinearly in the number $N$ of cross-section units, i.e., $\Lambda^{(0)\top}\Lambda^{(0)}/N^{\alpha}$ is positive definite in the limit for some $\alpha\in (0,1)$. However, the established convergence rates for weak factors can be much slower especially for small $\alpha$. This article proposes a Transfer Principal Component Analysis (TransPCA) method for enhancing the convergence rates for weak factors by transferring knowledge from large number of available informative panel datasets, which should not be turned a blind eye on in this big data era. We aggregate useful information by analyzing a weighted average projection matrix of the estimated loading spaces from all informative datasets which is highly flexible and computationally efficient. Theoretically, we derive the convergence rates of the estimators of weak/strong loading spaces and factor scores. The results indicate that as long as the auxiliary datasets are similar enough to the target dataset and the auxiliary sample size is sufficiently large, TransPCA estimators can achieve faster convergence rates in contrast to performing PCA solely on the target dataset. To avoid negative transfer, we also investigate the case that the informative datasets are unknown and provide a criterion for selecting useful datasets. Thorough simulation studies and {empirical analysis on real datasets in areas of macroeconomic and finance} are conducted to illustrate the usefulness of our proposed methods where large number of source panel datasets are naturally available.
Abstract: 早期的研究证明了大维近似因子模型中主成分估计量(因子和载荷)的收敛性,其中弱因子的载荷矩阵 $\Lambda^{(0)}$ 在截面单元数 $N$ 增长时以次线性方式缩放,即当 $\Lambda^{(0)\top}\Lambda^{(0)}/N^{\alpha}$ 在某种情况下趋于正定矩阵 $\alpha\in (0,1)$ 时成立。 然而,对于弱因子而言,已确立的收敛速度可能非常慢,特别是当 $\alpha$ 较小时。 本文提出了一种迁移主成分分析(TransPCA)方法,通过从大量可用的信息面板数据集中转移知识来提高弱因子的收敛速度,这在大数据时代不应被忽视。 我们通过分析所有信息数据集估计载荷空间的加权平均投影矩阵来聚合有用信息,这种方法具有高度灵活性且计算效率高。 理论上,我们推导出弱/强载荷空间和因子得分估计量的收敛速度。 结果表明,只要辅助数据集与目标数据集足够相似,并且辅助样本量足够大,与仅在目标数据集上执行PCA相比,TransPCA估计量可以实现更快的收敛速度。 为了避免负面迁移,我们还研究了信息数据集未知的情况,并提供了一种选择有用数据集的标准。 进行了全面的模拟研究和 {宏观经济和金融领域真实数据集的经验分析} 来说明我们提出的方法的实用性,在这种情况下,大量的源面板数据集自然可用。
Subjects: Statistics Theory (math.ST)
Cite as: arXiv:2503.08397 [math.ST]
  (or arXiv:2503.08397v1 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2503.08397
arXiv-issued DOI via DataCite

Submission history

From: Yong He [view email]
[v1] Tue, 11 Mar 2025 13:03:58 UTC (277 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
math.ST
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math
stat
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号