arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.00882stat.ME
收藏

具有潜在因子结构的子组识别

Subgroup Identification with Latent Factor Structure

Yong He, Dong Liu, Fuxin Wang, Mingjuan Zhang, Wen-Xin Zhou

AI总结:

针对协变量高度相关时子组识别困难的问题,提出因子增强线性模型下的中心增强子组识别方法,兼具降维与稀疏回归优势,计算复杂度低,并开发了R包SILFS。

摘要:

子组分析因其能够在异质性群体中识别有意义的子组,从而增强预测能力而受到越来越多的关注。然而,在社会科学和生物学等许多领域,由于共同因子的存在,协变量之间往往高度相关。这种相关性对子组识别构成了重大挑战,而现有文献中这一问题常常被忽视。在本文中,我们旨在解决“发散维度”机制下的这一空白,提出了一种在因子增强(稀疏)线性模型框架内的中心增强子组识别方法。该方法弥合了降维与稀疏回归之间的鸿沟。我们提出的方法能够适应协变量之间较高的横截面依赖性,并且具有计算优势,其复杂度为$O(nK)$,而文献中传统的成对融合惩罚方法的复杂度为$O(n^2)$,其中$n$是样本量,$K$是子组数量。我们还在组质心最小距离的条件下研究了预言估计量的渐近性质。为了实施所提出的方法,我们引入了一种基于凸函数差分的交替方向乘子法(DC-ADMM)算法,并证明了其在有限步内收敛到局部极小值。通过广泛的数值实验和一个真实的宏观经济数据示例,我们展示了所提出方法的优越性。一个实现该方法的R包SILFS也可在CRAN上获得。

英文摘要:

Subgroup analysis has garnered increasing attention for its ability to identify meaningful subgroups within heterogeneous populations, thereby enhancing predictive power. However, in many fields such as social science and biology, covariates are often highly correlated due to common factors. This correlation poses significant challenges for subgroup identification, an issue that is often overlooked in existing literature. In this paper, we aim to address this gap in the ``diverging dimension" regime by proposing a center-augmented subgroup identification method within the Factor Augmented (sparse) Linear Model framework. This method bridges dimension reduction and sparse regression. Our proposed approach is adaptable to the high cross-sectional dependence among covariates and offers computational advantages with a complexity of $O(nK)$, compared to the $O(n^2)$ complexity of the conventional pairwise fusion penalty method in the literature, where $n$ is the sample size and $K$ is the number of subgroups. We also investigate the asymptotic properties of the oracle estimators under conditions on the minimal distance between group centroids. To implement the proposed approach, we introduce a Difference of Convex functions-based Alternating Direction Method of Multipliers (DC-ADMM) algorithm and demonstrate its convergence to a local minimizer in a finite number of steps. We illustrate the superiority of the proposed method through extensive numerical experiments and a real macroeconomic data example. An \texttt{R} package, \texttt{SILFS}, implementing the method is also available on CRAN.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑