An Empirical Process View of Inverse Regression

A common approach taken in high‐dimensional regression analysis is sliced inverse regression, which separates the range of the response variable into non‐overlapping regions, called ‘slices’. Asymptotic results are usually shown assuming that the slices are fixed, while in practice, estimators are computed with random slices containing the same number of observations. Based on empirical process theory, we present a unified theoretical framework to study these techniques, and revisit popular inverse regression estimators. Furthermore, we introduce a bootstrap methodology that reproduces the laws of Cramér–von Mises test statistics of interest to model dimension, effects of specified covariates and whether or not a sliced inverse regression estimator is appropriate. Finally, we investigate the accuracy of different bootstrap procedures by means of simulations.     

Complete convergence for arrays of rowwise negatively superadditive-dependent random variables and its applications

In this paper, the Rosenthal-type maximal inequalities and Kolmogorov-type exponential inequality for negatively superadditive-dependent (NSD) random variables are presented. By using these inequalities, we study the complete convergence for arrays of rowwise NSD random variables. As applications, the Baum–Katz-type result for arrays of rowwise NSD random variables and the complete consistency for the estimator of nonparametric regression model based on NSD errors are obtained. Our results extend and improve the corresponding ones of Chen et al. [On complete convergence for arrays of rowwise negatively associated random variables. Theory Probab Appl. 2007;52(2):393–397] for arrays of rowwise negatively associated random variables to the case of arrays of rowwise NSD random variables.     

A Bias–Reduced Log–Periodogram Regression Estimator for the Long–Memory Parameter

In this paper, we propose a simple bias–reduced log–periodogram regression estimator, ^d_r, of the long–memory parameter, d, that eliminates the first– and higher–order biases of the Geweke and Porter–Hudak (1983) (GPH) estimator. The bias–reduced estimator is the same as the GPH estimator except that one includes frequencies to the power 2k for k=1,…,r, for some positive integer r, as additional regressors in the pseudo–regression model that yields the GPH estimator. The reduction in bias is obtained using assumptions on the spectrum only in a neighborhood of the zero frequency. Following the work of Robinson (1995b) and Hurvich, Deo, and Brodsky (1998), we establish the asymptotic bias, variance, and mean–squared error (MSE) of ^d_r, determine the asymptotic MSE optimal choice of the number of frequencies, m, to include in the regression, and establish the asymptotic normality of ^d_r. These results show that the bias of ^d_r goes to zero at a faster rate than that of the GPH estimator when the normalized spectrum at zero is sufficiently smooth, but that its variance only is increased by a multiplicative constant. We show that the bias–reduced estimator ^d_r attains the optimal rate of convergence for a class of spectral densities that includes those that are smooth of order s≥1 at zero when r≥(s−2)/2 and m is chosen appropriately. For s>2, the GPH estimator does not attain this rate. The proof uses results of Giraitis, Robinson, and Samarov (1997). We specify a data–dependent plug–in method for selecting the number of frequencies m to minimize asymptotic MSE for a given value of r. Some Monte Carlo simulation results for stationary Gaussian ARFIMA (1, d, 1) and (2, d, 0) models show that the bias–reduced estimators perform well relative to the standard log–periodogram regression estimator.     

对零势点选择若干问题的探讨

讨论几种典型电场的零势点位置的确定 ,说明选择零势点的原则     

从高校毕业生看大学趋同现象

随着高等教育的大众化,大学生就业难已成为一种社会问题。越来越多的用人单位认为大学毕业生的技能和品质与其所要求的不相符合,而导致这种现象的重要原因之一是大学的日益趋同。在这种背景下,政府应加强进一步引导,通过深化改革人才培养模式、改革单一的评估体系、创办＂特色型＂大学等方式改变大学趋同现象,使大学绽放出独具特色的光芒。     

无穷级数比值判别法的推广

给出了正项级数关于敛散性的一个新的判别法 ,这一方法推广了达朗贝尔比值判别法     

商法的国际化

在阐述各国商法所具有同质性的基础上,以商法的国际化为例对商法国际化的原因、发展趋势等问题进行思考,得出随着市场经济的日益复杂和全球化,商法的趋同化成为未来商法发展的必然趋势,最后论述了中国的商事立法应面对这种现实,在商事立法中坚持国际性优先,兼顾处于市场经济初级阶段的实际的立法对策问题。     

Provincial Conditional Income Convergence in China, 1953-1997: A Panel Data Approach

This paper examines the tendency towards income convergence among China's main provinces during the two periods: the pre-reform period 1953-1977 and the reform period 1978-1997 using the framework of the Solow growth model. The panel data method accounts for not only province-specific initial technology level but also the heterogeneity of the technological progress rate between the fast-growing coastal and interior provinces. Estimation problems of weak instruments and endogeneity are addressed by the use of a system generalized method of moments (GMM) estimator. The main empirical finding is that there is a system-wide income divergence during the reform period because the coastal provinces do not share a common technology progress rate with the interior provinces.     

Conditional Functional Principal Components Analysis

Abstract.  This work proposes an extension of the functional principal components analysis (FPCA) or Karhunen–Loève expansion, which can take into account non-parametrically the effects of an additional covariate. Such models can also be interpreted as non-parametric mixed effect models for functional data. We propose estimators based on kernel smoothers and a data-driven selection procedure of the smoothing parameters based on a two-step cross-validation criterion. The conditional FPCA is illustrated with the analysis of a data set consisting of egg laying curves for female fruit flies. Convergence rates are given for estimators of the conditional mean function and the conditional covariance operator when the entire curves are collected. Almost sure convergence is also proven when one observes discretized noisy sample paths only. A simulation study allows us to check the good behaviour of the estimators.     

Genetic algorithms for numerical optimization

Genetic algorithms (GAs) are stochastic adaptive algorithms whose search method is based on simulation of natural genetic inheritance and Darwinian striving for survival. They can be used to find approximate solutions to numerical optimization problems in cases where finding the exact optimum is prohibitively expensive, or where no algorithm is known. However, such applications can encounter problems that sometimes delay, if not prevent, finding the optimal solutions with desired precision. In this paper we describe applications of GAs to numerical optimization, present three novel ways to handle such problems, and give some experimental results.