样本选择模型截距项的半参数估计及应用———户籍工资差异分解研究

样本选择模型是解决样本选择问题的主要工具,广泛应用于工资差异分解、平均处理效应测算等实证研究。截距项的估计是样本选择模型半参数估计中相对独立且重要的一部分,现有的以无穷处识别为代表的半参数估计方法存在窗宽参数难以选取的问题。为此,本文把无穷处识别等价转化为边界处识别,并基于新的识别关系给出样本选择模型截距项的核估计方法。这种新方法的好处在于将样本选择模型截距项的估计纳入核估计框架中,从而可以采用经验法则解决现有方法的窗宽选取难题。数值模拟结果表明,本文所提出的估计方法在不同设定下均有良好的有限样本表现。把这种新的半参数估计方法应用于户籍工资差异分解后发现,我国劳动力市场目前不存在明显的户籍差别待遇。     

A modified least-failures sampling procedure for bernoulli subset selection

We restrict attention to a class of Bernoulli subset selection procedures which take observations one-at-a-time and can be compared directly to the Gupta-Sobel single-stage procedure. For the criterion of minimizing the expected total number of observations required to terminate experimentation, we show that optimal sampling rules within this class are not of practical interest. We thus turn to procedures which, although not optimal, exhibit desirable behavior with regard to this criterion. A procedure which employs a modification of the so-called least-failures sampling rule is proposed, and is shown to possess many desirable properties among a restricted class of Bernoulli subset selection procedures. Within this class, it is optimal for minimizing the number of observations taken from populations excluded from consideration following a subset selection experiment, and asymptotically optimal for minimizing the expected total number of observations required. In addition, it can result in substantial savings in the expected total num¬ber of observations required as compared to a single-stage procedure, thus it may be de¬sirable to a practitioner if sampling is costly or the sample size is limited.     

A plug-in the number of knots selector for polynomial spline regression

A plug-in the number of interior knots (NIKs) selector is proposed for polynomial spline estimation in nonparametric regression. The existence and properties of the optimal NIKs for spline regression are established by minimising the weighted mean integrated squared error. We obtain plug-in formulae for the optimal NIKs based on the theoretical results of asymptotic optimality, and develop strategies for choosing the NIKs of the spline estimator. The proposed NIKs selection method is tested on our simulated data with quite satisfactory performance, and is illustrated by analysing a fossil data set.     

Robust variable selection and parametric component identification in varying coefficient models

ABSTRACT

In this paper, we study a novelly robust variable selection and parametric component identification simultaneously in varying coefficient models. The proposed estimator is based on spline approximation and two smoothly clipped absolute deviation (SCAD) penalties through rank regression, which is robust with respect to heavy-tailed errors or outliers in the response. Furthermore, when the tuning parameter is chosen by modified BIC criterion, we show that the proposed procedure is consistent both in variable selection and the separation of varying and constant coefficients. In addition, the estimators of varying coefficients possess the optimal convergence rate under some assumptions, and the estimators of constant coefficients have the same asymptotic distribution as their counterparts obtained when the true model is known. Simulation studies and a real data example are undertaken to assess the finite sample performance of the proposed variable selection procedure.     

On the Optimality of Prediction-based Selection Criteria and the Convergence Rates of Estimators

Several estimators of squared prediction error have been suggested for use in model and bandwidth selection problems. Among these are cross-validation, generalized cross-validation and a number of related techniques based on the residual sum of squares. For many situations with squared error loss, e.g. nonparametric smoothing, these estimators have been shown to be asymptotically optimal in the sense that in large samples the estimator minimizing the selection criterion also minimizes squared error loss. However, cross-validation is known not to be asymptotically optimal for some `easy' location problems. We consider selection criteria based on estimators of squared prediction risk for choosing between location estimators. We show that criteria based on adjusted residual sum of squares are not asymptotically optimal for choosing between asymptotically normal location estimators that converge at rate n ^1/2but are when the rate of convergence is slower. We also show that leave-one-out cross-validation is not asymptotically optimal for choosing between √ n -differentiable statistics but leave- d -out cross-validation is optimal when d ∞ at the appropriate rate.     

On finite-sample properties of adaptive least squares regression estimates

This paper is mainly concerned with deriving finite-sample properties of least squares estimators for the regression function in a nonparametric regression situation under some simplifying assumptions such as normally distributed errors with a common known variance. The selection of basis functions to be used for the construction of an estimator may be regarded as a smoothing problem, and will usually be done in a data-dependent way, A straightforward application of a result by P. J. Kernpthorne yields that, under a squared error loss, all selection procedures are admissible. Furthermore, the minimax approach provides an interpolating estimator, which is often impractical, Therefore, within a certain class of selection procedures an optimal one is determined using the minimax regret principle. It can be seen to behave similarly to the procedure minimizing either an unbiased risk estimator or, equivalently, the C_p-criterion.     

Optimal sample coordination using controlled selection

Sample coordination maximizes or minimizes the overlap of two or more samples selected from overlapping populations. It can be applied to designs with simultaneous or sequential selection of samples. We propose a method for sample coordination in the former case. We consider the case where units are to be selected with maximum overlap using two designs with given unit inclusion probabilities. The degree of coordination is measured by the expected sample overlap, which is bounded above by a theoretical bound, called the absolute upper bound, and which depends on the unit inclusion probabilities. If the expected overlap equals the absolute upper bound, the sample coordination is maximal. Most of the methods given in the literature consider fixed marginal sampling designs, but in many cases, the absolute upper bound is not achieved. We propose to construct optimal sampling designs for given unit inclusion probabilities in order to realize maximal coordination. Our method is based on some theoretical conditions on joint selection probability of two samples and on the controlled selection method with linear programming implementation. The method can also be applied to minimize the sample overlap.     

Criterion and selection of optimal subsets in the linear regression,two stage procedures

In many practical situation the regression analysis with stochastic regressors is used. The estimations of this model are often influenced by a high degree of multicollinearity. For avoidance of this fact a criterion and a procedure for the selection of an optimal subset for regression will be derived on the base of the partition of the moments of the conditional normal distribution of the regressand under the condition of the regressors. Further two stage procedures improving the result of the subset regression. based also on the partition of the conditional moments will be given.     

Selecting the better binomial population under a budget constraint

The problem of optimal non-sequential allocation of observations for the selection of the better binomial population is considered in the case of fixed sampling costs and budget. With the appropriate choice of selection rule it is shown that a 70% reduction in the probability of incorrect selection is possible by using an unequal rather than equal allocation. Simple formulae are given for the appropriate selection rule and unequal allocation in large samples.     

Selection of the splined variables and convergence rates in a partial spline model

A method based on the principle of unbiased risk estimation is used to select the splined variables in an exploratory partial spline model proposed by Wahba (1985). The probability of correct selection based on the proposed procedure is discussed under regularity conditions. Furthermore, the resulting estimate of the regression function achieves the optimal rates of convergence over a general class of smooth regression functions (Stone 1982) when its underlying smoothness condition is not known.     

Constructing non-regular robust parameter designs

In recent years there has been considerable attention paid to robust parameter design as a strategy for variance reduction. Of particular concern is the selection of a good experimental plan in light of the two different types of factors in the experiment (control and noise) and the asymmetric manner in which effects of the same order are treated. Recent work has focussed on the selection of regular fractional factorial designs in this setting. In this article, we consider the construction and selection of optimal non-regular experiment plans for robust parameter design. Our approach defines the word-length pattern for non-regular fractional factorial designs with two different types of factors which allows for the choice of optimal design to emphasize the estimation of the effects of interest. We use this new word-length pattern to rank non-regular robust parameter designs. We show that one can easily find minimum aberration robust parameter designs from existing orthogonal arrays. The methodology is demonstrated by finding optimal assignments for control and noise factors for 12, 16 and 20-run orthogonal arrays.     

Adaptive Modeling Procedure Selection by Data Perturbation

Many procedures have been developed to deal with the high-dimensional problem that is emerging in various business and economics areas. To evaluate and compare these procedures, modeling uncertainty caused by model selection and parameter estimation has to be assessed and integrated into a modeling process. To do this, a data perturbation method estimates the modeling uncertainty inherited in a selection process by perturbing the data. Critical to data perturbation is the size of perturbation, as the perturbed data should resemble the original dataset. To account for the modeling uncertainty, we derive the optimal size of perturbation, which adapts to the data, the model space, and other relevant factors in the context of linear regression. On this basis, we develop an adaptive data-perturbation method that, unlike its nonadaptive counterpart, performs well in different situations. This leads to a data-adaptive model selection method. Both theoretical and numerical analysis suggest that the data-adaptive model selection method adapts to distinct situations in that it yields consistent model selection and optimal prediction, without knowing which situation exists a priori. The proposed method is applied to real data from the commodity market and outperforms its competitors in terms of price forecasting accuracy.     

A deviance-based criterion for model selection in GLM

Model selection is the most persuasive problem in generalized linear models. A model selection criterion based on deviance called the deviance-based criterion (DBC) is proposed. The DBC is obtained by penalizing the difference between the deviance of the fitted model and the full model. Under certain weak conditions, DBC is shown to be a consistent model selection criterion in the sense that with probability approaching to one, the selected model asymptotically equals the optimal model relating response and predictors. Further, the use of DBC in link function selection is also discussed. We compare the proposed model selection criterion with existing methods. The small sample efficiency of proposed model selection criterion is evaluated by the simulation study.     

遗传算法在投资组合模型中的应用

均值-VaR模型是比较复杂的非线性规划问题，传统的算法不能保证得到全局最优值。鉴于此，引入遗传算法求解资产配置比例。对基于均值-VaR的单目标优化问题，设计了限定搜索空间和惩罚函数的遗传算法；而对多目标优化问题，应用并行选择遗传算法，并以沪深300行业分类指数构建投资组合，分析了行业资产配置的投资组合问题。结果表明，算法取得了良好的效果，解的结果既满足了投资的目标和约束条件，又反映了投资者之间不同的收益风险需求，且具有较好的实践性。     

Interview Costs in the Secretary Problem

The effect of interview costs on the optimal selection strategy and on the chance of success in secretary problems with order k selection rules, both for a finite number of applicants and in the limiting case, is examined. Probabilistic reasoning is used and numerical examples given.     

Optimal sequencing of experiments in Bayesian group testing

A Bayesian formulation of the group testing problem with testing error is considered. Under the assumption that testing error follows a Bernoulli distribution, optimal sequences of experiments can be characterized. It is shown that an intuitive and appealing experiment selection rule eventually will select optimal sequences of experiments almost surely.     

Selection rules based on divergences

This paper deals with a special adaptive estimation problem, namely how can one select for each set of i.i.d. data X ₁, …, X _n the better of two given estimates of the data-generating probability density. Such a problem was studied by Devroye and Lugosi [Combinatorial Methods in Density Estimation, Springer, Berlin, 2001] who proposed a feasible suboptimal selection (called the Scheffé selection) as an alternative to the optimal but nonfeasible selection which minimizes the L₁-error. In many typical situations, the L₁-error of the Scheffé selection was shown to tend to zero for n→∞ as fast as the L₁-error of the optimal estimate. This asymptotic result was based on an inequality between the total variation errors of the Scheffé and optimal selections. The present paper extends this inequality to the class of φ-divergence errors containing the L₁-error as a special case. The first extension compares the φ-divergence errors of the mentioned Scheffé and optimal selections of Devroye and Lugosi. The second extension deals with a class of generalized Scheffé selections adapted to the φ-divergence error criteria and reducing to the classical Scheffé selection for the L₁-criterion. It compares the φ-divergence errors of these feasible selections and the optimal nonfeasible selections minimizing the φ-divergence errors. Both extensions are motivated and illustrated by examples.     

基于投资者异质性的投资组合选择与证券市场价格

 马科维茨给出了风险规避型投资者最优投资组合的解,并论证了组合投资的风险分散功能。然而组合投资是否只是风险规避型投资者的“专利”呢？本文依据马科维茨均值-方差模型的研究范式,在充分讨论不同风险偏好投资者投资组合选择最优解的基础上,分别剖析了风险规避、中性、追求型三类投资者投资组合选择行为,以此为依据来探讨均衡条件下证券市场运行特征,并相应给出我国证券市场的经验证据。分析结果表明：无论哪类风险偏好型投资者,其都存在可供选择的最优投资组合方案,只是风险追求型投资者的最优解复杂一些罢了,风险中性型投资者将选择ETF工具代替市场组合,且他们的选择行为对市场运行不产生影响,市场运行完全由风险规避和风险追求型投资者的行为决定,虽然我们从投资组合选择的差异上无法区分个体投资者的风险偏好类型,但我国证券市场整体却表现出明显的风险追求型特征。     

On completely data-driven bandwidth selection for single-index models

The class of single-index models (SIMs) has become an important tool for nonparametric regression analysis. As with any other nonparametric regression models, the selection of bandwidth plays an important role in the inferences of the SIMs. However, most results in the literature either take the bandwidths as externally given, or require unpractical assumptions or very restrictive conditions for data-driven bandwidths. We examine the asymptotic properties of a popular bandwidth selection method based on cross-validation that is completely data-driven, under much weaker conditions than those assumed in the literature. And we show that the same bandwidth that is optimal for estimating the index vector, can be used for nearly optimal error variance estimation through the method of varying cross-validation. A simulation study is presented to demonstrate the finite sample performance of the proposed procedures, based on which we recommend a simple 2-step procedure for bandwidth selection, index vector estimation, as well as error variance estimation.     

Selecting more reliable weibull populations than a control

This paper deals with the selection of Weibull populations that are more reliable than a control population at some specified time. In the case when the shape parameters are known, a locally optimal selection rule is derived. From this rule, a modified one is proposed for the case when the shape parameter is unknown but has a known prior distribution. Simulation study shows that this modified rule is quite robust.