论文检索

高维单指标模型：连接函数估计与坐标推断AI 解读

This study proposes a novel method for estimation and hypothesis testing in high-dimensional single-index models. We address a common scenario where the sample size and the dimension of regression coefficients are large and comparable. Unlike previous approaches, which often overlook the estimation of the unknown link function, we introduce a new method for link function estimation. Leveraging the information from the estimated link function, we propose more efficient…

重审近似因子模型主成分估计量的渐近理论AI 解读

It is well known that approximate factor models exhibit rotation indeterminacy. Principal component (PC) estimators are typically analyzed relative to a rotated factor-loading representation, but the commonly used rotation depends on the estimator itself, leaving unclear which fixed population parameters are estimated. We show that any starting representation of the common component can be mapped by a rotation matrix $\bH$, constructed without using the PC estimator or the…

后筛选投资组合选择AI 解读

We propose post-screening portfolio selection (PS$^2$), a two-step framework for high-dimensional mean--variance investing. First, assets are screened by Lasso-type regression of a constant on excess returns without an intercept. Second, portfolio weights are estimated on the selected set using standard low-dimensional methods. Because strong factors can destroy sparsity in real data, we further introduce PS$^2$ with factors (FPS$^2$), which defactors returns before…

弱因子下因子增强回归模型的偏差修正AI 解读

In this paper, we study the asymptotic bias of the factor-augmented regression estimator and its reduction, which is augmented by the $r$ factors extracted from a large number of $N$ variables with $T$ observations. In particular, we consider general weak latent factor models with $r$ signal eigenvalues that may diverge at different rates, $N^{α_{k}}$, $0<α_{k}\leq 1$, $k=1,\dots,r$. In the existing literature, the bias has been derived using an approximation for the…

稳健且可复现的网络探索AI 解读

We propose a novel methodology for discovering the presence of relationships realized as binary time series between variables in high dimension. To make it visually intuitive, we regard the existence of a relationship as an edge connection, and call a collection of such edges a network. Our objective is thus rephrased as uncovering the network by selecting relevant edges, referred to as the network exploration. Our methodology is based on multiple testing for the presence or…