Xin Qi

Xin Qi

Auto-generated profile, based on publicly available information

Xin Qi

Department of Mathematics and Statistics Georgia State University 30 Pryor Street 30303-3083 Atlanta GA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2013 in Journal of Multivariate Analysis
Verified
Journal Article
Closed access
XQXin Qi
Xin Qi
RLRuiyan Luo
Ruiyan Luo
HZHongyu Zhao
Hongyu Zhao

1 January 2019 in Statistica Sinica
Verified
Journal Article
Closed access
XQXin Qi
Xin Qi
RLRuiyan Luo
Ruiyan Luo

8 July 2014 in Scandinavian Journal of Statistics
Verified
Journal Article
Closed access
PDF file
XQXin Qi
Xin Qi
RLRuiyan Luo
Ruiyan Luo

3 April 2015 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
XQXin Qi
Xin Qi
RLRuiyan Luo
Ruiyan Luo
RCRaymond J. Carroll
Raymond J. Carroll
HZHongyu Zhao
Hongyu Zhao
Recent years have seen active developments of various penalized regression methods, such as LASSO and elastic net, to analyze high-dimensional data. In these approaches, the direction and length of the regression coefficients are determined simultaneously. Due to the introduction of penalties, the length of the estimates can be far from being optimal for accurate predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths and the tuning parameters are determined by a cross-validation procedure to achieve the largest prediction accuracy. We provide a theoretical result for simultaneous model selection consistency and parameter estimation consistency of our method in high dimension. This new framework is then generalized such that it can be applied to principal components analysis, partial least squares, and canonical correlation analysis. We also adapt this framework for discriminant analysis. Compared with the existing methods, where there is relatively little control of the dependency among the sparse components, our method can control the relationships among the components. We present efficient algorithms and related theory for solving the sparse regression by projection problem. Based on extensive simulations and real data analysis, we demonstrate that our method achieves good predictive performance and variable selection in the regression setting, and the ability to control relationships between the sparse components leads to more accurate classification. In supplementary materials available online, the details of the algorithms and theoretical proofs, and R codes for all simulation studies are provided.

5 August 2015 in arXiv
Verified
Preprint
Open access
PDF file
RLRuiyan Luo
Ruiyan Luo
XQXin Qi
Xin Qi
Many sparse linear discriminant analysis (LDA) methods have been proposed to overcome the major problems of the classic LDA in high-dimensional settings. However, the asymptotic optimality results are limited to the case that there are only two classes, which is due to the fact that the classification boundary of LDA is a hyperplane and explicit formulas exist for the classification error in this case. In the situation where there are more than two classes, the classification boundary is usually complicated and no explicit formulas for the classification errors exist. In this paper, we consider the asymptotic optimality in the high-dimensional settings for a large family of linear classification rules with arbitrary number of classes under the situation of multivariate normal distribution. Our main theorem provides easy-to-check criteria for the asymptotic optimality of a general classification rule in this family as dimensionality and sample size both go to infinity and the number of classes is arbitrary. We establish the corresponding convergence rates. The general theory is applied to the classic LDA and the extensions of two recently proposed sparse LDA methods to obtain the asymptotic optimality. We conduct simulation studies on the extended methods in various settings.

5 August 2015 in arXiv
Verified
Preprint
Open access
PDF file
RLRuiyan Luo
Ruiyan Luo
XQXin Qi
Xin Qi
In this paper, we consider multivariate response regression models with high dimensional predictor variables. One way to model the correlation among the response variables is through the low rank decomposition of the coefficient matrix, which has been considered by several papers for the high dimensional predictors. However, all these papers focus on the singular value decomposition of the coefficient matrix. Our target is the decomposition of the coefficient matrix which leads to the best lower rank approximation to the regression function, the signal part in the response. Given any rank, this decomposition has nearly the smallest expected prediction error among all approximations to the the coefficient matrix with the same rank. To estimate the decomposition, we formulate a penalized generalized eigenvalue problem to obtain the first matrix in the decomposition and then obtain the second one by a least squares method. In the high-dimensional setting, we establish the oracle inequalities for the estimates. Compared to the existing theoretical results, we have less restrictions on the distribution of the noise vector in each observation and allow correlations among its coordinates. Our theoretical results do not depend on the dimension of the multivariate response. Therefore, the dimension is arbitrary and can be larger than the sample size and the dimension of the predictor. Simulation studies and application to real data show that the proposed method has good prediction performance and is efficient in dimension reduction for various reduced rank models.