A smoothed maximum score estimator for the binary choice panel data model with an application to labour force participation

In a binary choice panel data model with individual effects and two time periods, Manski proposed the maximum score estimator based on a discontinuous objective function and proved its consistency under weak distributional assumptions. The rate of convergence is low ( N ^1/3) and its limit distribution cannot easily be used for statistical inference. In this paper we apply the idea of Horowitz to smooth Manski's objective function. The resulting smoothed maximum score estimator is consistent and asymptotically normal with a rate of convergence that can be made arbitrarily close to N ^1/2, depending on the strength of the smoothness assumptions imposed. The estimator can be applied to panels with more than two time periods and to unbalanced panels. We apply the estimator to analyze labour force participation of married Dutch females.     

An alternative definition of individual bioequivalence

Several definitions of individual bioequivalence of two formulations of a medical treatment (drug) have been proposed recently. These definitions attempt to adapt the criterion of average bioequivalence, which would be deficient if substantive treatment heterogeneity were present. In some of the proposed definitions, relatively large differences of means can be compensated by differences in the measurement-error variances. We propose a definition based on a simple latent-variable model which overcomes this anomaly and need not involve the U.S. Food and Drug Administration's 80/125 rule. Our approach is based on a moment-matching estimator of the discrepancy between the outcomes underlying the subjects' responses. The distribution of this estimator is a linear combination of independent χ² variates; asymptotically, it can be approximated by a normal distribution. Evidence of individual bioequivalence corresponds to rejecting the hypothesis that the discrepancy is greater than a specified threshold. The approach is illustrated by reanalysing two bioequivalence trials.     

First-Order Integer-Valued Autoregressive (INAR (1)) Process: Distributional and Regression Properties

Some properties of a first-order integer-valued autoregressive process (INAR)) are investigated. The approach begins with discussing the self-decomposability and unimodality of the 1-dimensional marginals of the process {X_n} generated according to the scheme X_n=α° X _n-i +e_n, where α° X _n-1 denotes a sum of X_{n - 1}, independent 0 - 1 random variables Y^(n-1), independent of X _n-1 with Pr -( y ^{(n - 1)}= 1) = 1 - Pr ( y ^(n-i)= 0) =α. The distribution of the innovation process ( e _n) is obtained when the marginal distribution of the process ( X _n) is geometric. Regression behavior of the INAR(1) process shows that the linear regression property in the backward direction is true only for the Poisson INAR(1) process.     

Statistics for the contact process

A d -dimensional contact process is a simplified model for the spread of an infection on the lattice Z ^d . At any given time t ≥ 0 , certain sites x ∈ Z ^d are infected while the remaining once are healthy. Infected sites recover at constant rate 1, while healthy sites are infected at a rate proportional to the number of infected neighboring sites. The model is parametrized by the proportionality constant λ. If λ is sufficiently small, infection dies out (subcritical process), whereas if λ is sufficiently large infection tends to be permanent (supercritical process).
In this paper we study the estimation problem for the parameter λ of the supercritical contact process starting with a single infected site at the origin. Based on an observation of this process at a single time t , we obtain an estimator for the parameter λ which is consistent and asymptotically normal as t →∞     

An improved empirical Bayes test for positive exponential families

We exhibit an empirical Bayes test δ^* _n for a decision problem using a linear error loss in a class of positive exponential families. This empirical Bayes test δ^* _n possesses the asymptotic optimality, and its associated regret converges to zero with rate n ⁻¹(ln n )⁶ This rate of convergence improves the previous results in the literature in the sense that a faster rate of convergence is achieved under much weaker conditions. Examples are presented to illustrate the performance of the empirical Bayes test δ^* _n     

Approximation for the cumulative and inverse gamma distribution

The gamma distribution function can be expressed in terms of the Normal distribution and density functions with sufficient accuracy for most practical purposes.
The distribution function for the density x^Λ-1e^-x/μ/μ^ΛΓ(A) on 0 -R(Λ){(1 + 1/1 2Λ) φ(z) + 11 -z/4Λ^1/2+2(z²+ 2)/45Λ] φ(z) /3 Λ^1/2} where φ(z)≅1/[1 +_e^{-2z(√2/π+z2 /28)}] and φ(z) = e^{-z2 /2}/√2π are the Normal distribution and density functions, y is the appropriate root of y-y²/6+y³/36-y⁴/270= In (x/Λμ), z= Λ^1/2 y, and R( Λ) is the remainder term in Stirling's approximation for In Γ(Λ).     

Asymptotic properties of estimators for the volume fractions of jointly stationary random sets

In the present paper, we show how a consistent estimator can be derived for the asymptotic covariance matrix of stationary 0–1-valued vector fields in R ^d , whose supports are jointly stationary random closed sets. As an example, which is of particular interest for statistical applications, we consider jointly stationary random closed sets associated with the Boolean model in R ^d such that the components indicate the frequency of coverage by the single grains of the Boolean model. For this model, a representation formula for the entries of the covariance matrix is obtained.     

SKEWNESS FOR THE WEIBULL FAMILY

Abstract. The skewness of the Weibull family of distributions is discussed for all values of the shape parameter. This class includes unimodal probability densities for which the coefficient of skewness μ₃/o³ is positive, but the order of the mean, median and mode is μ < m < M. For values of the shape parameter used in practice the distributions are skewed to the right by a well accepted definition of skewness.     

The effect of a Durbin–Watson pretest on confidence intervals in regression

Consider a linear regression model and suppose that our aim is to find a confidence interval for a specified linear combination of the regression parameters. In practice, it is common to perform a Durbin–Watson pretest of the null hypothesis of zero first‐order autocorrelation of the random errors against the alternative hypothesis of positive first‐order autocorrelation. If this null hypothesis is accepted then the confidence interval centered on the ordinary least squares estimator is used; otherwise the confidence interval centered on the feasible generalized least squares estimator is used. For any given design matrix and parameter of interest, we compare the confidence interval resulting from this two‐stage procedure and the confidence interval that is always centered on the feasible generalized least squares estimator, as follows. First, we compare the coverage probability functions of these confidence intervals. Second, we compute the scaled expected length of the confidence interval resulting from the two‐stage procedure, where the scaling is with respect to the expected length of the confidence interval centered on the feasible generalized least squares estimator, with the same minimum coverage probability. These comparisons are used to choose the better confidence interval, prior to any examination of the observed response vector.     

A minimum chi-squared method for indirect parameter estimation from Poisson data

In this paper, we introduce a new algorithm for estimating non-negative parameters from Poisson observations of a linear transformation of the parameters. The proposed objective function fits both a weighted least squares (WLS) and a minimum χ² estimation framework, and results in a convex optimization problem. Unlike conventional WLS methods, the weights do not need to be estimated from the datas, but are incorporated in the objective function. The iterative algorithm is derived from an alternating projection procedure in which "distance" is determined by the chi-squared test statistic, which is interpreted as a measure of the discrepancy between two distributions. This may be viewed as an alternative to the Kullback-Leibler divergence which corresponds to the maximum likelihood (ML) estimation. The algorithm is similar in form to, and shares many properties with, the expectation maximization algorithm for ML estimation. In particular, we show that every limit point of the algorithm is an estimator, and the sequence of projected (by the linear transformation into the data space) means converge. Despite the similarities, we show that the new estimators are quite distinct from ML estimators, and obtain conditions under which they are identical.     

PSEUDO-R2 MEASURES FOR SOME COMMON LIMITED DEPENDENT VARIABLE MODELS

Abstract. A large number of different Pseudo- R ² measures for some common limited dependent variable models are surveyed. Measures include those based solely on the maximized likelihoods with and without the restriction that slope coefficients are zero, those which require further calculations based on parameter estimates of the coefficients and variances and those that are based solely on whether the qualitative predictions of the model are correct or not. The theme of the survey is that while there is no obvious criterion for choosing which Pseudo- R ² to use, if the estimation is in the context of an underlying latent dependent variable model, a case can be made for basing the choice on the strength of the numerical relationship to the OLS- R ² in the latent dependent variable. As such an OLS- R ² can be known in a Monte Carlo simulation, we summarize Monte Carlo results for some important latent dependent variable models (binary probit, ordinal probit and Tobit) and find that a Pseudo- R ² measure due to McKelvey and Zavoina scores consistently well under our criterion. We also very briefly discuss Pseudo- R ² measures for count data, for duration models and for prediction-realization tables.     

A LIMIT THEOREM FOR BERNOULLI RV'S AND FELLER'S SHOE PROBLEM

Consider n sets of objects, each set consisting of m distinct types (for instance n place settings each made up of m distinct dishes and silverware pieces.) s items are drawn at random from the mn items. The distribution of the number of complete sets (each consisting of all m items) in the sample of s is asymptotically Poisson distributed with parameter (a /m )^m if s = an ^1–1 and n →∞. This fact can be interpreted in terms of a certain limit theorem for a sequence of i.i.d Bernoulli rv's.     

The asymptotic distribution of the sum of weighted squared residuals in binary choice models

It is claimed by some authors that the distribution of the sum of weighted squared residuals, used as a goodness of fit measure in binary choice models, behaves for large n as a x²_n– k–1 distribution. This claim seems to be based on a false analogy with the well–known Pearson x² statistic for frequency tables with a fixed number of cells and cell sizes tending to infinity. We derive the asymptotic (normal) distribution and show that the approximation by the x² distribution in general will not be valid. A new x² test is proposed based on the asymptotic normality of the measure.     

A Simple Artificial Regression Based Test of the Goodness of Fit of Binary Choice Models

A test of the goodness of fit of a binary choice model is derived using the conditional moment testing approach. The test statistic may be calculated as the explained sum of squares or N:R² in a simple artificial regression. The test statistic has reasonably good small sample properties since it is not based on the outer product gradient (OPG) form.     

Generalized densities of order statistics

Let X ₁, ... , X _n be independent identically distributed random variables with distribution F . We derive expressions for generalized joint 'densities' of order statistics of X ₁, ... , X _n , for arbitrary distributions F , in terms of Radon–Nikodym derivatives with respect to product measures based on F . We then give formulae for conditional distributions of order statistics and use them to derive results concerning Markov properties of order statistics, formulae for distributions of trimmed sums, and other useful representations. Our approach leads to simple and natural expressions which appear not to have been given before.     

Ridge regression revisited

In general ridge (GR) regression p ridge parameters have to be determined, whereas simple ridge regression requires the determination of only one parameter. In a recent textbook on linear regression, Jürgen Gross argues that this constitutes a major complication. However, as we show in this paper, the determination of these p parameters can fairly easily be done. Furthermore, we introduce a generalization of the GR estimator derived by Hemmerle and by Teekens and de Boer. This estimator, which is more conservative, performs better than the Hoerl and Kennard estimator in terms of a weighted quadratic loss criterion.     

Estimation of the intensity of a Poisson point process by means of nearest neighbor distances

A new unbiased consistent asymptotically normal estimator U _k of the intensity λ of a stationary multivariate Poisson point process is exhibited. This estimate is based on a combination of the j -th nearest neighbor (possibly non Euclidean) distances ( j =1, ..., k ) to a single fixed site x . A simple closed form containing logarithmic terms is obtained for E ( U ^l _k )(0< l < k ).     

Logistic回归的ArctanLASSO惩罚似然估计及应用

Logistic回归是计量经济学中应用最广的离散选择模型。当变量个数较多时,极大似然估计解释性较差,为此本文基于新的惩罚函数ArctanLASSO,给出Logistic回归的一种非凸惩罚似然估计进行参数估计和变量选取,并证明了估计量的n1/2相合性和Oracle性质。本文结合二阶近似处理、LLA方法和梯度下降法给出估计算法,并通过最小化BIC准则对正则化参数进行选取。模拟数据分析显示,当样本量较大时,该方法在参数估计和变量选取两个方面都优于传统的LASSO、SCAD和MCP方法,样本量较小时,该方法同样具有很大优势。实际数据分析表明,该方法很好地权衡了拟合程度和非零系数的选择,是最优的备选模型,具有重要的实际意义。     

Asymptotics and smoothing parameter selection for penalized spline regression with various loss functions

Penalized splines are used in various types of regression analyses, including non‐parametric quantile, robust and the usual mean regression. In this paper, we focus on the penalized spline estimator with general convex loss functions. By specifying the loss function, we can obtain the mean estimator, quantile estimator and robust estimator. We will first study the asymptotic properties of penalized splines. Specifically, we will show the asymptotic bias and variance as well as the asymptotic normality of the estimator. Next, we will discuss smoothing parameter selection for the minimization of the mean integrated squares error. The new smoothing parameter can be expressed uniquely using the asymptotic bias and variance of the penalized spline estimator. To validate the new smoothing parameter selection method, we will provide a simulation. The simulation results show that the consistency of the estimator with the proposed smoothing parameter selection method can be confirmed and that the proposed estimator has better behavior than the estimator with generalized approximate cross‐validation. A real data example is also addressed.     

Scheduling identical jobs on uniform parallel machines

We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize scheduling criteria that are nondecreasing in the job completion times. It is well known that this can be formulated as a linear assignment problem, and subsequently solved in O ( n ³) time. We give a more concise formulation for minsum criteria, and show that general minmax criteria can be minimized in O ( n ²) time. We present faster algorithms, requiring only O ( n + m log m ) time for minimizing makespan and total completion time, O ( n log n ) time for minimizing total weighted completion time, maximum lateness, total tardiness and the weighted number of tardy jobs, and O ( n log² n ) time for maximum weighted tardiness. In the case of release dates, we propose an O ( n log n ) algorithm for minimizing makespan, and an O ( mn ^2m+1) time dynamic programming algorithm for minimizing total completion time.