Sufficient dimension reduction through informative predictor subspace

The purpose of this paper is to define the central informative predictor subspace to contain the central subspace and to develop methods for estimating the former subspace. Potential advantages of the proposed methods are no requirements of linearity, constant variance and coverage conditions in methodological developments. Therefore, the central informative predictor subspace gives us the benefit of restoring the central subspace exhaustively despite failing the conditions. Numerical studies confirm the theories, and real data analyses are presented.     

Trace pursuit variable selection for multi-population data

Variable selection is a very important tool when dealing with high dimensional data. However, most popular variable selection methods are model based, which might provide misleading results when the model assumption is not satisfied. Sufficient dimension reduction provides a general framework for model-free variable selection methods. In this paper, we propose a model-free variable selection method via sufficient dimension reduction, which incorporates the grouping information into the selection procedure for multi-population data. Theoretical properties of our selection methods are also discussed. Simulation studies suggest that our method greatly outperforms those ignoring the grouping information.     

Sparse subspace linear discriminant analysis

We study high dimensional multigroup classification from a sparse subspace estimation perspective, unifying the linear discriminant analysis (LDA) with other recent developments in high dimensional multivariate analysis using similar tools, such as penalization method. We develop two two-stage sparse LDA models, where in the first stage, convex relaxation is used to convert two classical formulations of LDA to semidefinite programs, and furthermore subspace perspective allows for straightforward regularization and estimation. After the initial convex relaxation, we use a refinement stage to improve the accuracy. For the first model, a penalized quadratic program with group lasso penalty is used for refinement, whereas a sparse version of the power method is used for the second model. We carefully examine the theoretical properties of both methods, alongside with simulations and real data analysis.     

Sufficient dimension reduction via distance covariance with multivariate responses

In this article, we propose a new method for sufficient dimension reduction when both response and predictor are vectors. The new method, using distance covariance, keeps the model-free advantage, and can fully recover the central subspace even when many predictors are discrete. We then extend this method to the dual central subspace, including a special case of canonical correlation analysis. We illustrated estimators through extensive simulations and real datasets, and compared to some existing methods, showing that our estimators are competitive and robust.     

关于Perron-Frobenius定理的两个推论

根据Perron-Frobenius定理论证两个推论以及若干结果,反映了不可约非负矩阵模等于谱半径的特征值对应的特征子空间之间的关系,对相关结论略有推广.     

OFDM信道估计的子空间方法

介绍了OFDM信道盲估计的子空间方法及其研究现状,并对文献[6]的算法按照WLAN802.11a的符号格式在存在虚载波及导频的情况下进行了性能仿真,研究了要达到一定的精度,算法应选取的包长及算法对信道SNR的要求。仿真结果表明导频格式会影响算法的收敛,但通过加入不相关的导频,能保证算法的收敛。     

NON-PARAMETRIC ESTIMATION OF DIRECTION IN SINGLE-INDEX MODELS WITH CATEGORICAL PREDICTORS

This paper proposes a general dimension‐reduction method targeting the partial central subspace recently introduced by Chiaromonte, Cook & Li. The dependence need not be confined to particular conditional moments, nor are restrictions placed on the predictors that are necessary for methods like partial sliced inverse regression. The paper focuses on a partially linear single‐index model. However, the underlying idea is applicable more generally. Illustrative examples are presented.     

Approximate E-optimal designs for the model of spring balance weighing with a constant bias

The present paper analyzes the linear regression model with a nonzero intercept term on the vertices of a d-dimensional unit cube. This setting may be interpreted as a model of weighing d objects on a spring balance with a constant bias. We give analytic formulas for E-optimal designs, as well as their minimal efficiencies under the class of all orthogonally invariant optimality criteria, proving the criterion-robustness of the E-optimal designs. We also discuss the D- and A-optimal designs for this model.     

Analysing nonlinear time series with central subspace

Traditionally, time series analysis involves building an appropriate model and using either parametric or nonparametric methods to make inference about the model parameters. Motivated by recent developments for dimension reduction in time series, an empirical application of sufficient dimension reduction (SDR) to nonlinear time series modelling is shown in this article. Here, we use time series central subspace as a tool for SDR and estimate it using mutual information index. Especially, in order to reduce the computational complexity in time series, we propose an efficient estimation method of minimal dimension and lag using a modified Schwarz–Bayesian criterion, when either of the dimensions and the lags is unknown. Through simulations and real data analysis, the approach presented in this article performs well in autoregression and volatility estimation.     

The sliced inverse regression algorithm as a maximum likelihood procedure

It is shown that the sliced inverse regression procedure proposed by Li corresponds to the maximum likelihood estimate where the observations in each slice are samples of multivariate normal distributions with means in an affine manifold.