Chang, Tang & Wu (2013, AoS; 16, AoS) first introduced a method for selecting ultra-high-dimensional covariates using marginal hypothesis testing, effectively addressing the limitations of existing methods and significantly reducing the data and model requirements and constraints imposed by other methods. They proposed using the value of the empirical likelihood ratio at 0 as a test statistic to measure whether the marginal contribution of each covariate is zero, which avoids the identification problems that may arise when directly estimating marginal contributions. Furthermore, based on the characteristics of empirical likelihood self-normalization, this test statistic can avoid the impact of heteroscedasticity.
Chang, Guo & Yao (2015, JoE) proposed a fast factor dimensionality reduction method by spectral decomposition of a positive-definite matrix, avoiding the need to solve ultra-high-dimensional optimization problems directly and overcoming the computational bottleneck faced by traditional methods. Even when the observed data dimensions reach thousands, this method can perform dimensionality reduction in just a few seconds on a personal laptop.
Chang, Guo & Yao (2018, AoS) proposed a dimensionality reduction method based on linear transformations. They transformed the observed data into a new set of data through linear transformations, where the components in the new data can be grouped, and there is no correlation between the groups. This effectively avoided the two main problems of “overparameterization” and “model non-identifiability” that arise when directly modeling. In practice, even when such linear transformations do not exist, forcing the dimensionality reduction and subsequent grouping for modeling still significantly improved predictive accuracy.
Chang, He, Yang & Yao (2023, JRSSB) proposed a dimensionality reduction method for complex matrix-type time series through tensor CP decomposition and introduced a fast algorithm that does not require iteration to complete the solution. This improved upon the common approach in the literature, which typically relies on iterative algorithms for CP decomposition. The authors have developed these methods into an R software package PCA4TS, freely available for others to use.