论文检索

通过不变矩条件实现识别与多矩条件稳健推断AI 解读

Identification-robust hypothesis tests are commonly based on the continuous updating GMM objective function. When the number of moment conditions grows proportionally with the sample size, the large-dimensional weighting matrix prohibits the use of conventional asymptotic approximations and the behavior of these tests remains unknown. We show that the structure of the weighting matrix opens up an alternative route to asymptotic results when, under the null hypothesis, the…

异质误差方差下线性面板模型的分组异质性AI 解读

We develop a procedure to identify latent group structures in linear panel data models that exploits a grouping in the error variances of cross-sectional units. To accommodate such grouping, we introduce an objective function that avoids a singularity that arises in a pseudolikelihood approach. We provide theoretical and numerical evidence showing when allowing for variance groups improves classification. The developed procedure provides new evidence on the relation between…

线性回归中基于Stein型平均估计量的联合推断AI 解读

While averaging unrestricted with restricted estimators is known to reduce estimation risk, it is an open question whether this reduction in turn can improve inference. To analyze this question, we construct joint confidence regions centered at James–Stein averaging estimators in both homoskedastic and heteroskedastic linear regression models. These regions are asymptotically valid when the number of restrictions increases possibly proportionally with the sample size. When…

《高维普通最小二乘投影变量筛选》的引理修正说明AI 解读

The conclusion in Lemma 5 in the supplementary material (SM) of Wang and Leng (2016), on which Theorems 1–3 rely, is incorrect. Here we provide an additional condition under which the conclusion of this lemma holds. We assume that the rows of the matrix X follow a Gaussian distribution with precision matrix Ω = Σ−1 that satisfies c 4 - 1 n - τ / 2 ≤ λ min ( Ω ) ≤ λ max ( Ω ) ≤ c 4 n τ / 2 . This implies the assumption on the condition number of Σ in Assumption A3. We drop…

建模结构突变能否提高预测准确性？AI 解读

Mean square forecast error loss implies a bias–variance trade-off that suggests that structural breaks of small magnitude should be ignored. In this paper, we provide a test to determine whether modeling a structural break improves forecast accuracy. The test is near optimal even when the date of a local-to-zero break is not consistently estimable. The results extend to forecast combinations that weight the post-break sample and the full sample forecasts by our test…

使用随机子空间方法进行预测AI 解读

Random subspace methods are a new approach to obtain accurate forecasts in high-dimensional regression settings. Forecasts are constructed by averaging over forecasts from many submodels generated by random selection or random Gaussian weighting of predictors. This paper derives upper bounds on the asymptotic mean squared forecast error of these strategies, which show that the methods are particularly suitable for macroeconomic forecasting. An empirical application to the…

马尔可夫转换模型的最优预测AI 解读

We derive forecasts for Markov switching models that are optimal in the mean square forecast error (MSFE) sense by means of weighting observations. We provide analytic expressions of the weights conditional on the Markov states and conditional on state probabilities. This allows us to study the effect of uncertainty around states on forecasts. It emerges that, even in large samples, forecasting performance increases substantially when the construction of optimal weights…