Sufficient Dimension Reduction via Distance Covariance

We introduce a novel approach to sufficient dimension-reduction problems using distance covariance. Our method requires very mild conditions on the predictors. It estimates the central subspace effectively even when many predictors are categorical or discrete. Our method keeps the model-free advantage without estimating link function. Under regularity conditions, root-n consistency and asymptotic normality are established for our estimator. We compare the performance of our method with some existing dimension-reduction methods by simulations and find that our method is very competitive and robust across a number of models. We also analyze the Auto MPG data to demonstrate the efficacy of our method. Supplemental materials for this article are available online.     

Sufficient Dimension Reduction and Variable Selection for Large-p-Small-n Data With Highly Correlated Predictors

Sufficient dimension reduction (SDR) is a paradigm for reducing the dimension of the predictors without losing regression information. Most SDR methods require inverting the covariance matrix of the predictors. This hinders their use in the analysis of contemporary datasets where the number of predictors exceeds the available sample size and the predictors are highly correlated. To this end, by incorporating the seeded SDR idea and the sequential dimension-reduction framework, we propose a SDR method for high-dimensional data with correlated predictors. The performance of the proposed method is studied via extensive simulations. To demonstrate its use, an application to microarray gene expression data where the response is the production rate of riboflavin (vitamin B₂) is presented.     

Dimension Reduction in Regressions With Exponential Family Predictors

We present first methodology for dimension reduction in regressions with predictors that, given the response, follow one-parameter exponential families. Our approach is based on modeling the conditional distribution of the predictors given the response, which allows us to derive and estimate a sufficient reduction of the predictors. We also propose a method of estimating the forward regression mean function without requiring an explicit forward regression model. Whereas nearly all existing estimators of the central subspace are limited to regressions with continuous predictors only, our proposed methodology extends estimation to regressions with all categorical or a mixture of categorical and continuous predictors. Supplementary materials including the proofs and the computer code are available from the JCGS website.     

Sufficient Dimension Folding for Regression Mean Function

In this article, we consider sufficient dimension folding for the regression mean function when predictors are matrix- or array-valued. We propose a new concept named central mean dimension folding subspace and its two local estimation methods: folded outer product of gradients estimation (folded-OPG) and folded minimum average variance estimation (folded-MAVE). We establish the asymptotic properties for folded-MAVE. A modified BIC criterion is used to determine the dimensions of the central mean dimension folding subspace. We evaluate the performances of the two local estimation methods by simulated examples and demonstrate the efficacy of folded-MAVE in finite samples. And in particular, we apply our methods to analyze a longitudinal study of primary biliary cirrhosis. Supplementary materials for this article are available online.     

Sliced Coordinate Analysis for Effective Dimension Reduction and Nonlinear Extensions

Sliced inverse regression (SIR) is an important method for reducing the dimensionality of input variables. Its goal is to estimate the effective dimension reduction directions. In classification settings, SIR is closely related to Fisher discriminant analysis. Motivated by reproducing kernel theory, we propose a notion of nonlinear effective dimension reduction and develop a nonlinear extension of SIR called kernel SIR (KSIR). Both SIR and KSIR are based on principal component analysis. Alternatively, based on principal coordinate analysis, we propose the dual versions of SIR and KSIR, which we refer to as sliced coordinate analysis (SCA) and kernel sliced coordinate analysis (KSCA), respectively. In the classification setting, we also call them discriminant coordinate analysis and kernel discriminant coordinate analysis. The computational complexities of SIR and KSIR rely on the dimensionality of the input vector and the number of input vectors, respectively, while those of SCA and KSCA both rely on the number of slices in the output. Thus, SCA and KSCA are very efficient dimension reduction methods.     

Dimension Asymptotics for Generalised Bootstrap in Linear Regression

We prove consistency of a class of generalised bootstrap techniques for the distribution of the least squares parameter estimator in linear regression, when the number of parameters tend to infinity with data size and the regressors are random. We show that best results are obtainable with resampling techniques that have not been considered earlier in the literature.     

一种基于正则参数化的降维细分算法(英文)

In our previous work, we have given an algorithm for segmenting a simplex in the n-dimensional space into rt n＋ 1 polyhedrons and provided map F which maps the n-dimensional unit cube to these polyhedrons. In this paper, we prove that the map F is a one to one correspondence at least in lower dimensional spaces （n _〈 3）. Moreover, we propose the approximating subdivision and the interpolatory subdivision schemes and the estimation of computational complexity for triangular Bézier patches on a 2-dimensional space. Finally, we compare our schemes with Goldman＇s in computational complexity and speed.     

一类非线性EV模型的降维估计

考虑响应变量随机缺失情形下的非线性EV模型.给出了未知参数的降维估计,有效避免了高维核估计带来的维数灾祸问题.所构造的统计量渐近于x~2分布,所得结果可以用来构造未知参数的置信域.     

Sufficient Conditions for Error Bounds and Applications

Our aim in this paper is to present sufficient conditions for error bounds in terms of Fréchet and limiting Fréchet subdifferentials in general Banach spaces. This allows us to develop sufficient conditions in terms of the approximate subdifferential for systems of the form (x, y) C × D, g(x, y, u) = 0, where g takes values in an infinite-dimensional space and u plays the role of a parameter. This symmetric structure offers us the choice of imposing conditions either on C or D. We use these results to prove the nonemptiness and weak-star compactness of Fritz–John and Karush–Kuhn–Tucker multiplier sets, to establish the Lipschitz continuity of the value function and to compute its subdifferential and finally to obtain results on local controllability in control problems of nonconvex unbounded differential inclusions.     

Dimension Reduction via Marginal Fourth Moments in Regression

The conditional mean of the response given the predictors is often of interest in regression problems. The central mean subspace, recently introduced by Cook and Li, allows inference about aspects of the mean function in a largely nonparametric context. We propose a marginal fourth moments method for estimating directions in the central mean subspace that might be missed by existing methods such as ordinary least squares (OLS) and principal Hessian directions (pHd). Our method, targeting higher order trends, particularly cubics, complements OLS and pHd because there is no inclusion among them. Theory, estimation and inferences as well as illustrative examples are presented.     

Dimension reduction based on weighted variance estimate

In this paper, we propose a new estimate for dimension reduction, called the weighted variance estimate (WVE), which includes Sliced Average Variance Estimate (SAVE) as a special case. Bootstrap method is used to select the best estimate from the WVE and to estimate the structure dimension. And this selected best estimate usually performs better than the existing methods such as Sliced Inverse Regression (SIR), SAVE, etc. Many methods such as SIR, SAVE, etc. usually put the same weight on each observation to estimate central subspace (CS). By introducing a weight function, WVE puts different weights on different observations according to distance of observations from CS. The weight function makes WVE have very good performance in general and complicated situations, for example, the distribution of regressor deviating severely from elliptical distribution which is the base of many methods, such as SIR, etc. And compared with many existing methods, WVE is insensitive to the distribution of the regressor. The consistency of the WVE is established. Simulations to compare the performances of WVE with other existing methods confirm the advantage of WVE. This work was supported by National Natural Science Foundation of China (Grant No. 10771015)     

A Test for Additivity in Nonparametric Regression

A simple consistent test of additivity in a multiple nonparametric regression model is proposed, where data are observed on a lattice. The new test is based on an estimator of the L ²-distance between the (unknown) nonparametric regression function and its best approximation by an additive nonparametric regression model. The corresponding test-statistic is the difference of a classical ANOVA style statistic in a two-way layout with one observation per cell and a variance estimator in a homoscedastic nonparametric regression model. Under the null hypothesis of additivity asymptotic normality is established with a limiting variance which involves only the variance of the error of measurements. The results are extended to models with an approximate lattice structure, a heteroscedastic error structure and the finite sample behaviour of the proposed procedure is investigated by means of a simulation study.     

一个半参数回归模型中Cramér渐近有效性的充要条件(英语)

本文考虑模型Y_i=X~Tβ g(T) ε,这里(X~T,T,Y,)是k 2-维随机向量,g是未知光滑函数,ε是均值为零方差有限的随机误差。本文证明了,的最小二乘估计是Cramer渐近有效的充要条件是误差6服从正态分布N(0,口’)。     

Dimension Theory and Fuchsian Groups

In this paper we review some concepts of Dimension Theory in Dynamical Systems and we show how to apply them for studying growth rates of Kleinian groups acting on the hyperbolic plane H ². The mainly focus on: multifractal analysis, additive and nonadditive thermodynamic formalisms and Gibbs states. In order to connect these concepts with groups we define a family of potentials _n ():=d _h (O,e ₀ e ₁...e _n (O)), (the limit set of ), where d _h is the hyperbolic metric in H ² and e ₀ e ₁... is a sequence in the generators of assigned to . These sequences are obtained from the method by C. Series for coding hyperbolic geodesics. Next, a decomposition in level sets K :={:lim _n =} is considered and a variational multifractal analysis of the entropy spectrum of K , by means of the formalism developed by Barreira, is done.     

Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem

We propose a new algorithm for sparse estimation of eigenvectors in generalized eigenvalue problems (GEPs). The GEP arises in a number of modern data-analytic situations and statistical methods, including principal component analysis (PCA), multiclass linear discriminant analysis (LDA), canonical correlation analysis (CCA), sufficient dimension reduction (SDR), and invariant co-ordinate selection. We propose to modify the standard generalized orthogonal iteration with a sparsity-inducing penalty for the eigenvectors. To achieve this goal, we generalize the equation-solving step of orthogonal iteration to a penalized convex optimization problem. The resulting algorithm, called penalized orthogonal iteration, provides accurate estimation of the true eigenspace, when it is sparse. Also proposed is a computationally more efficient alternative, which works well for PCA and LDA problems. Numerical studies reveal that the proposed algorithms are competitive, and that our tuning procedure works well. We demonstrate applications of the proposed algorithm to obtain sparse estimates for PCA, multiclass LDA, CCA, and SDR. Supplementary materials for this article are available online.     

Dimension reduction for second-order systems by general orthogonal polynomials

In this article, we discuss the time-domain dimension reduction methods for second-order systems by general orthogonal polynomials, and present a structure-preserving dimension reduction method for second-order systems. The resulting reduced systems not only preserve the second-order structure but also guarantee the stability under certain conditions. The error estimate of the reduced models is also given. The effectiveness of the proposed methods is demonstrated by three test examples.     

Dimension Reduction in Nonparametric Kernel Discriminant Analysis

This article develops a dimension-reduction method in kernel discriminant analysis, based on a general concept of separation of populations. The ideas we present lead to a characterization of the central subspace that does not impose restrictions on the marginal distribution of the feature vector. We also give a new procedure for estimating relevant directions in the central subspace. Comparisons to other procedures are studied and examples of application are discussed.     

Hazard Rate Regression Using Ordinary Nonparametric Regression Smoothers

Abstract

This article proposes a method for nonparametric estimation of hazard rates as a function of time and possibly multiple covariates. The method is based on dividing the time axis into intervals, and calculating number of event and follow-up time contributions from the different intervals. The number of event and follow-up time data are then separately smoothed on time and the covariates, and the hazard rate estimators obtained by taking the ratio. Pointwise consistency and asymptotic normality are shown for the hazard rate estimators for a certain class of smoothers, which includes some standard approaches to locally weighted regression and kernel regression. It is shown through simulation that a variance estimator based on this asymptotic distribution is reasonably reliable in practice. The problem of how to select the smoothing parameter is considered, but a satisfactory resolution to this problem has not been identified. The method is illustrated using data from several breast cancer clinical trials.     

Automatic Response Category Combination in Multinomial Logistic Regression

We propose a penalized likelihood method that simultaneously fits the multinomial logistic regression model and combines subsets of the response categories. The penalty is nondifferentiable when pairs of columns in the optimization variable are equal. This encourages pairwise equality of these columns in the estimator, which corresponds to response category combination. We use an alternating direction method of multipliers algorithm to compute the estimator and we discuss the algorithm’s convergence. Prediction and model selection are also addressed. Supplemental materials for this article are available online.